Results 1 to 10 of about 4,412 (118)
Algorithmic complexity of secure connected domination in graphs
AKCE International Journal of Graphs and Combinatorics, 2020 Let be a simple, undirected, and connected graph. A connected (total) dominating set is a secure connected (total) dominating set of G, if for each there exists such that and is a connected (total) dominating set of G. The minimum cardinality of a secure
J. Pavan Kumar +2 more
doaj +2 more sources
The Domination Parameters on a kind of the regular honeycomb structure [PDF]
Computer Science Journal of Moldova, 2022 The honeycomb mesh, based on hexagonal structure, has enormous applications in chemistry and engineering. A major challenge in this field is to understand the unique properties of honeycomb structures, which depend on their properties of topology. One
Fateme Movahedi +2 more
doaj +1 more source
Bridge domination in fuzzy graphs [PDF]
Journal of Fuzzy Extension and Applications, 2023 In communication networks, strong connectivity between nodes is critical. The failure of strong connectivity between nodes may jeopardize the network’s stability. In fuzzy graphs, various dominating sets using strong edges are identified to avoid network
Sivasankar Shanmugam +2 more
doaj +1 more source
The Detour Domination and Connected Detour Domination values of a graph
Ratio Mathematica, 2022 The number of -sets that belongs to in G is defined as the detour domination value of indicated by for each vertex . In this article, we examined at the concept of a graph’s detour domination value.
R.V Revathi, M Antony
doaj +1 more source
Progress on Roman and Weakly Connected Roman Graphs
Mathematics, 2021 A graph G for which γR(G)=2γ(G) is the Roman graph, and if γRwc(G)=2γwc(G), then G is the weakly connected Roman graph. In this paper, we show that the decision problem of whether a bipartite graph is Roman is a co-NP-hard problem. Next, we prove similar
Joanna Raczek, Rita Zuazua
doaj +1 more source
Perfect edge domination in vague graphs
Ratio Mathematica, 2021 In this paper, we modified undirected vague graphs and edge domination set based on these two concepts. We study the notions of perfect edge domination, connected perfect edge domination of vague graph. Moreover, we investigate some related properties in
M Kaliraja, P Kanibose, Abdul Ibrahim
doaj +1 more source
Ratio Mathematica, 2022 Let be a simple graph.Let be the family of connected 2 dominating sets in with cardinality and |.Then the polynomial is called the 2 domination polynomial of where is the connected 2 domination number of Let be the family of connected 2 dominating ...
Y.A. Shiny, Anithababy T
doaj +1 more source
Connected End Anti-Fuzzy Equitable Dominating Set In Anti-Fuzzy Graphs
Ratio Mathematica, 2023 In this paper, the notion of connected end anti-fuzzy equitable dominating set of an anti-fuzzy graph is discussed. The connected end anti-fuzzy equitable domination number for some standard graphs are obtained.
Janofer K, S.Firthous Fatima
doaj +1 more source
Some results on the independence number of connected domination critical graphs
AKCE International Journal of Graphs and Combinatorics, 2018 A --critical graph is a graph with connected domination number and for any pair of non-adjacent vertices and of . Let and be respectively the clique number and the independence number of a graph.
P. Kaemawichanurat, T. Jiarasuksakun
doaj +2 more sources
Total connected domination game [PDF]
Opuscula Mathematica, 2021 The (total) connected domination game on a graph \(G\) is played by two players, Dominator and Staller, according to the standard (total) domination game with the additional requirement that at each stage of the game the selected vertices induce a ...
Csilla Bujtás +3 more
doaj +1 more source