Total Restrained Domination Subdivision Number for Cartesian Product Graph

Author(s):  
P. Jeyanthi ◽  
G. Hemalatha
2014 ◽  
Vol 07 (04) ◽  
pp. 1450054
Author(s):  
Benjier H. Arriola ◽  
Sergio R. Canoy

Let G be a simple connected graph. A connected dominating set S ⊂ V(G) is called a doubly connected dominating set of G if the subgraph 〈V(G)\S〉 induced by V(G)\S is connected. We show that given any three positive integers a, b, and c with 4 ≤ a ≤ b ≤ c, where b ≤ 2a, there exists a connected graph G such that a = γr(G), b = γtr(G), and c = γcc(G), where γr, γtr, and γcc are, respectively, the restrained domination, total restrained domination, and doubly connected domination parameters. Also, we characterize the doubly connected dominating sets in the join of any graphs and Cartesian product of some graphs. The corresponding doubly connected domination numbers of these graphs are also determined.


Author(s):  
Nurma Ariska Sutardji ◽  
Liliek Susilowati ◽  
Utami Dyah Purwati

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.


2012 ◽  
Vol 241-244 ◽  
pp. 2802-2806
Author(s):  
Hua Dong Wang ◽  
Bin Wang ◽  
Yan Zhong Hu

This paper defined the hereditary property (or constant property) concerning graph operation, and discussed various forms of the hereditary property under the circumstance of Cartesian product graph operation. The main conclusions include: The non-planarity and Hamiltonicity of graph are hereditary concerning the Cartesian product, but planarity of graph is not, Euler characteristic and non-hamiltonicity of graph are not hereditary as well. Therefore, when we applied this principle into practice, we testified that Hamilton cycle does exist in hypercube.


2011 ◽  
Vol 480-481 ◽  
pp. 922-927 ◽  
Author(s):  
Yan Zhong Hu ◽  
Hua Dong Wang

Hypercube is one of the basic types of interconnection networks. In this paper, we use the concept of the Cartesian product graph to define the hypercube Qn, we study the relationship between the isomorphic graphs and the Cartesian product graphs, and we get the result that there exists a Hamilton cycle in the hypercube Qn. Meanwhile, the other properties of the hypercube Qn, such as Euler characteristic and bipartite characteristic are also introduced.


2013 ◽  
Vol 7 (1) ◽  
pp. 26
Author(s):  
Zahra Tahmasbzadehbaee ◽  
D Soner Nandappa ◽  
Hossein Abdollahzadeh Ahangar ◽  
Doost Ali Mojdeh ◽  
Yancai Zhao

Sign in / Sign up

Export Citation Format

Share Document