Global Domination Number of Squares of Certain Graphs
Main Article Content
Abstract
The square of a graph G= (V, E) is the graph G2 with the same vertex set as G and every two vertices u, v ϵ V are adjacent in G2 if and only if they are adjacent in G by a path of length one or two. Throughout this paper an attempt has been done to analyse the global domination of squares of certain graphs. We considered some connected graphs like paths, cycles, wheel graphs, complete tripartite, windmill graphs and some tree graphs. We characterised the global domination number of squares of a graph. We obtained a relationship between the global domination number of the square of some graphs and the domination number of the given graph. We also obtained the global domination number of squares of certain graphs.
AMS Subject Classification: 05C69
Downloads
Metrics
Article Details
Licensing
TURCOMAT publishes articles under the Creative Commons Attribution 4.0 International License (CC BY 4.0). This licensing allows for any use of the work, provided the original author(s) and source are credited, thereby facilitating the free exchange and use of research for the advancement of knowledge.
Detailed Licensing Terms
Attribution (BY): Users must give appropriate credit, provide a link to the license, and indicate if changes were made. Users may do so in any reasonable manner, but not in any way that suggests the licensor endorses them or their use.
No Additional Restrictions: Users may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.