Eccentric Domination in Boolean Graph BG2(G) of a Graph G
Main Article Content
Abstract
Let G be a simple (p, q) graph with vertex set V(G) and edge set E(G). BG2(G) is a graph with vertex set V(G) È E(G) and two vertices are adjacent if and only if they correspond to two adjacent vertices of G, a vertex and an edge incident to it in G or two non-adjacent edges of G. In this paper, we studied eccentric domination number of Boolean graph BG2(G), obtained bounds of this parameter and determined its exact value for several classes of graphs.
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.
