scholarly journals Totally irregular total labeling of some caterpillar graphs

2020 ◽  
Vol 8 (2) ◽  
pp. 247
Author(s):  
Diari Indriati ◽  
W. Widodo ◽  
Indah E. Wijayanti ◽  
Kiki A. Sugeng ◽  
Isnaini Rosyida
Keyword(s):  
Caterpillar Graphs

HOP DOMINATION NUMBER OF CATERPILLAR GRAPHS

2020 ◽  
Vol 9 (5) ◽  
pp. 2739-2748
Author(s):  
P. Getchialponpackiavathi ◽  
S. Balamurugan ◽  
R. B. Gnanajothi
Keyword(s):  
Domination Number ◽  
Caterpillar Graphs

A CODING TECHNIQUE WITH FELICITOUS LABELING AND CATERPILLAR GRAPHS

2020 ◽  
Vol 9 (11) ◽  
pp. 10211-10217
Author(s):  
V. Shendra Shainy ◽  
G. Margaret Joan Jebarani ◽  
V. Balaji
Keyword(s):  
Felicitous Labeling ◽  
Caterpillar Graphs

A Study on Radio Labeling of Diameter N-2 and Caterpillar Graphs

2018 ◽  
Vol 6 (8) ◽  
pp. 30
Author(s):  
M. Shakila ◽  
N. Rajakumari
Keyword(s):  
Chromatic Number ◽  
Basic Type ◽  
Graph Labeling ◽  
Vertex Coloring ◽  
Not Given ◽  
Minimum Value ◽  
Caterpillar Graphs ◽  
Radio Labeling

Radio labeling of graphs is a specific type of graph labeling. The basic type of graph labeling is vertex coloring; this is where the vertices of a graph G are assigned different colors so that adjacent vertices are not given the same color. A k-coloring of a graph G is a coloring that uses k colors. The chromatic number of a graph G is the minimum value for k such that a k-coloring exists for G [2].

scholarly journals Leaf realization problem, caterpillar graphs and prefix normal words

2018 ◽  
Vol 732 ◽  
pp. 1-13 ◽  
Author(s):  
Alexandre Blondin Massé ◽  
Julien de Carufel ◽  
Alain Goupil ◽  
Mélodie Lapointe ◽  
Émile Nadeau ◽  
...  
Keyword(s):  
Realization Problem ◽  
Caterpillar Graphs

scholarly journals Maximal independent sets in caterpillar graphs

2012 ◽  
Vol 160 (3) ◽  
pp. 259-266 ◽  
Author(s):  
Carmen Ortiz ◽  
Mónica Villanueva
Keyword(s):  
Independent Sets ◽  
Maximal Independent Sets ◽  
Caterpillar Graphs
Sign in / Sign up

Export Citation Format

Share Document