scholarly journals Star-rainbow coloring in some corona product graphs

2020 ◽  
Vol 1597 ◽  
pp. 012056
Author(s):  
Kulkarni Sunita Jagannatharao ◽  
R Murali
Keyword(s):  
Product Graphs ◽  
Corona Product ◽  
Rainbow Coloring

scholarly journals Rainbow coloring in some corona product graphs

2019 ◽  
Vol 7 (1) ◽  
pp. 127-131 ◽  
Author(s):  
Kulkarni Sunita Jagannatharao ◽  
R. Murali
Keyword(s):  
Product Graphs ◽  
Corona Product ◽  
Rainbow Coloring

scholarly journals On the metric dimension of corona product graphs

2011 ◽  
Vol 61 (9) ◽  
pp. 2793-2798 ◽  
Author(s):  
I.G. Yero ◽  
D. Kuziak ◽  
J.A. Rodríguez-Velázquez
Keyword(s):  
Metric Dimension ◽  
Product Graphs ◽  
Corona Product

scholarly journals On the strong metric dimension of corona product graphs and join graphs

2013 ◽  
Vol 161 (7-8) ◽  
pp. 1022-1027 ◽  
Author(s):  
Dorota Kuziak ◽  
Ismael G. Yero ◽  
Juan A. Rodríguez-Velázquez
Keyword(s):  
Metric Dimension ◽  
Product Graphs ◽  
Strong Metric Dimension ◽  
Corona Product

scholarly journals Analogies between the geodetic number and the Steiner number of some classes of graphs

Filomat ◽  
2015 ◽  
Vol 29 (8) ◽  
pp. 1781-1788 ◽  
Author(s):  
Ismael Yero ◽  
Juan Rodríguez-Velázquez
Keyword(s):  
Complete Graph ◽  
Open Problem ◽  
Minimum Size ◽  
Discrete Mathematics ◽  
Connected Subgraph ◽  
Minimum Cardinality ◽  
Geodetic Number ◽  
Product Graphs ◽  
Geodetic Set ◽  
Corona Product

A set of vertices S of a graph G is a geodetic set of G if every vertex v ? S lies on a shortest path between two vertices of S. The minimum cardinality of a geodetic set of G is the geodetic number of G and it is denoted by 1(G). A Steiner set of G is a set of vertices W of G such that every vertex of G belongs to the set of vertices of a connected subgraph of minimum size containing the vertices of W. The minimum cardinality of a Steiner set of G is the Steiner number of G and it is denoted by s(G). Let G and H be two graphs and let n be the order of G. The corona product G ? H is defined as the graph obtained from G and H by taking one copy of G and n copies of H and joining by an edge each vertex from the ith-copy of H to the ith-vertex of G. We study the geodetic number and the Steiner number of corona product graphs. We show that if G is a connected graph of order n ? 2 and H is a non complete graph, then g(G ? H) ? s(G ? H), which partially solve the open problem presented in [Discrete Mathematics 280 (2004) 259-263] related to characterize families of graphs G satisfying that g(G) ? s(G).

scholarly journals On the Local Metric Dimension of Corona Product Graphs

2015 ◽  
Vol 39 (S1) ◽  
pp. 157-173 ◽  
Author(s):  
Juan A. Rodríguez-Velázquez ◽  
Gabriel A. Barragán-Ramírez ◽  
Carlos García Gómez
Keyword(s):  
Metric Dimension ◽  
Product Graphs ◽  
Corona Product

ON LAPLACIAN SPECTRA OF SOME CORONA PRODUCT GRAPHS AND APPLICATIONS

2021 ◽  
Vol 10 (3) ◽  
pp. 1259-1271
Author(s):  
I.J. Gogoi ◽  
B. Phukan ◽  
A. Pegu ◽  
A. Bharali
Keyword(s):  
Laplacian Spectra ◽  
Product Graphs ◽  
Corona Product

scholarly journals Simultaneous Resolvability in Families of Corona Product Graphs

2016 ◽  
Vol 41 (3) ◽  
pp. 1541-1560 ◽  
Author(s):  
Yunior Ramírez-Cruz ◽  
Alejandro Estrada-Moreno ◽  
Juan A. Rodríguez-Velázquez
Keyword(s):  
Product Graphs ◽  
Corona Product

scholarly journals The vertex coloring of local antimagic total labeling on corona product graphs

2021 ◽  
Vol 1836 (1) ◽  
pp. 012020
Author(s):  
Ika Hesti Agustin ◽  
Dafik ◽  
Rosanita Nisviasari ◽  
Ridho Alfarisi ◽  
Marsidi
Keyword(s):  
Vertex Coloring ◽  
Product Graphs ◽  
Corona Product

scholarly journals On the Rainbow and Strong Rainbow Coloring of Comb Product Graphs

2018 ◽  
Vol 22 (3) ◽  
pp. 20-26
Author(s):  
Dafik Dafik ◽  
I.H. Agustin ◽  
D.A.R. Wardanai ◽  
E.Y. Kurniawati ◽  
R. Alfarisi
Keyword(s):  
Product Graphs ◽  
Rainbow Coloring

scholarly journals On independent position sets in graphs

2021 ◽  
Vol 40 (2) ◽  
pp. 385-398
Author(s):  
Elias John Thomas ◽  
Ullas Chandran S. V.
Keyword(s):  
Independent Set ◽  
Maximum Size ◽  
General Relationship ◽  
Lexicographic Product ◽  
Graph Invariants ◽  
General Properties ◽  
Product Graphs ◽  
Related Graph ◽  
Corona Product ◽  
Lexicographic Product Graphs

An independent set S of vertices in a graph G is an independent position set if no three vertices of S lie on a common geodesic. An independent position set of maximum size is an ip-set of G. The cardinality of an ip-set is the independent position number, denoted by ip(G). In this paper, we introduce and study the independent position number of a graph. Certain general properties of these concepts are discussed. Graphs of order n having the independent position number 1 or n − 1 are characterized. Bounds for the independent position number of Cartesian and Lexicographic product graphs are determined and the exact value for Corona product graphs are obtained. Finally, some realization results are proved to show that there is no general relationship between independent position sets and other related graph invariants.

Sign in / Sign up

Export Citation Format

Share Document