Edge Domination Number of Corona Product Graph of a Cycle with a Complete Graph

2017 ◽  
Vol 158 (3) ◽  
pp. 40-44
Author(s):  
J. Anitha ◽  
B. Maheswari
Keyword(s):  
Complete Graph ◽  
Domination Number ◽  
Product Graph ◽  
Corona Product

scholarly journals On the locating domination number of corona product

2018 ◽  
Vol 1008 ◽  
pp. 012053
Author(s):  
Risan Nur Santi ◽  
Ika Hesti Agustin ◽  
Dafik ◽  
Ridho Alfarisi
Keyword(s):  
Domination Number ◽  
Corona Product

scholarly journals Dimensi Metrik Kuat Lokal Graf Hasil Operasi Kali Kartesian

2020 ◽  
Vol 1 (2) ◽  
pp. 64
Author(s):  
Nurma Ariska Sutardji ◽  
Liliek Susilowati ◽  
Utami Dyah Purwati
Keyword(s):  
Graph Theory ◽  
Cartesian Product ◽  
Metric Dimension ◽  
Star Graph ◽  
Product Graph ◽  
Path Graph ◽  
Strong Metric Dimension ◽  
Metric Dimensions ◽  
Development Result ◽  
Corona Product

The strong local metric dimension is the development result of a strong metric dimension study, one of the study topics in graph theory. Some of graphs that have been discovered about strong local metric dimension are path graph, star graph, complete graph, cycle graphs, and the result corona product graph. In the previous study have been built about strong local metric dimensions of corona product graph. The purpose of this research is to determine the strong local metric dimension of cartesian product graph between any connected graph G and H, denoted by dimsl (G x H). In this research, local metric dimension of G x H is influenced by local strong metric dimension of graph G and local strong metric dimension of graph H. Graph G and graph H has at least two order.

On a Conjecture of Bollobás and Brightwell Concerning Random Walks on Product Graphs

1998 ◽  
Vol 7 (4) ◽  
pp. 397-401 ◽  
Author(s):  
OLLE HÄGGSTRÖM
Keyword(s):  
Random Walk ◽  
Random Walks ◽  
Discrete Time ◽  
Complete Graph ◽  
Continuous Time ◽  
Product Graph ◽  
Product Graphs ◽  
Continuous Time Random Walks ◽  
Discrete Time Case

We consider continuous time random walks on a product graph G×H, where G is arbitrary and H consists of two vertices x and y linked by an edge. For any t>0 and any a, b∈V(G), we show that the random walk starting at (a, x) is more likely to have hit (b, x) than (b, y) by time t. This contrasts with the discrete time case and proves a conjecture of Bollobás and Brightwell. We also generalize the result to cases where H is either a complete graph on n vertices or a cycle on n vertices.

scholarly journals Unidominating Functions of Corona Product Graph

2019 ◽  
Vol 177 (15) ◽  
pp. 44-47
Author(s):  
B. Aruna ◽  
B. Maheswari
Keyword(s):  
Product Graph ◽  
Corona Product
Sign in / Sign up

Export Citation Format

Share Document