The notion of the b-chromatic number of a graph attracted much research interests and
recently a new concept, namely the b-chromatic sum of a graph, denoted by φ′(G), has …

A Dutch windmill graph D (m) n, m≥ 1, n≥ 3 is the graph obtained by taking m copies of the
cycle graph Cn with a vertex in common. In this paper, we compute certain topological …

A set-labeling of a graph $ G $ is an injective function $ f: V (G)\to\mathcal {P}(X) $, where $
X $ is a finite set and a set-indexer of $ G $ is a set-labeling such that the induced function …

The b-chromatic number of a graph G is the maximum number k of colours in a proper
colouring of G, such that at least one vertex in each colour class has a neighbour in all other …

Let $ S= S_1S_2S_3\ldots S_n $ be a finite string. Write $ S $ in the form $ XYY\ldots Y=
XY^ k $, consisting of a prefix $ X $(which may be empty), followed by $ k $ copies of a non …

Given a finite nonempty sequence S of integers, write it as XY k, where Y k is a power of
greatest exponent that is a suffix of S: this k is the curling number of S. The concept of curling …

The curling number of a graph G is defined as the number of times an element in the degree
sequence of G appears the maximum. Graph colouring is an assignment of colours, labels …

The concepts of linear Jaco graphs and Jaco-type graphs have been introduced as certain
types of directed graphs with specifically defined adjacency conditions. The distinct …

Given a finite nonempty sequence S of integers, write it as XY k, where Y k is a power of
greatest exponent that is a suffix of S: this k is the curling number of S. The concept of curling …

The curling number of a graph G may be defined as the number of times an element in the
degree sequence of G appears the most. Graph colouring is an assignment of colours …