Results 81 to 84 of about 507 (84)

Extremal polyomino chains of VDB topological indices

, 2015
We show that the zig-zag chain Z3 n of segments of length 3 (see Figure 2) has the minimal ABC index among all polyomino chains with n squares. More generally, we give conditions on the numbers {φij} under which the zig-zag chain Z3 n is an extremal ...
Roberto Cruz, J. Rada
semanticscholar   +1 more source

Gracefulness of graphs obtained from vertex duplication

, 2016
A graceful labeling of a graph G with n edges is an injection f : V (G) → {0, 1, 2, . . . , n} with the property that the resulting edge labels are distinct where an edge incident with vertices u and v is assigned the label |f(u) − f(v)|.
G. Sethuraman, M. Sujasree, A. Velankanni   +2 more
semanticscholar   +1 more source

The b-Chromatic Number of Bistar Graph

, 2014
A b-coloring is a proper vertex coloring of a graph such that each color class contains a vertex that has a neighbor in all other color classes and the b-chromatic number is the largest integer ’(G)) for which a graph has a b-coloring with ’(G) colors ...
I. Diego, Frederick S. Gella
semanticscholar   +1 more source

Independent and Vertex Covering Number on Strong Product of Cycles

, 2013
Let α(G) and β(G) be the independent number and vertex covering number, respectively. The strong Product G1 G2 of graph of G1 and G2 has vertex set V (G1 G2 )= V (G1) × V (G2) and edge set E(G1 G2 )= {(u1v1)(u2v2)|[u1u2 ∈ E(G1) and v1v2 ∈ E(G2)] ∪ [u1 ...
Bunjong Kaewwisetkul, T. Sitthiwirattham
semanticscholar   +1 more source