Results 1 to 10 of about 232,724 (277)
Rainbow Connection Number and Connected Dominating Sets [PDF]
Electronic Notes in Discrete Mathematics, 2011 AbstractThe rainbow connection number of a connected graph is the minimum number of colors needed to color its edges, so that every pair of its vertices is connected by at least one path in which no two edges are colored the same. In this article we show that for every connected graph on n vertices with minimum degree δ, the rainbow connection number ...
Chandran, L. Sunil +3 more
openaire +5 more sources
Connected cototal domination number of a graph [PDF]
Transactions on Combinatorics, 2012 A dominating set $D subseteq V$ of a graph $G = (V,E)$ is said to be a connected cototal dominating set if $langle D rangle$ is connected and $langle V-D rangle neq phi$, contains no isolated vertices.
B Basavanagoud, Sunilkumar M Hosamani
doaj +2 more sources
Connected domination number and traceable graphs [PDF]
Electronic Journal of Mathematics, 2023 Phillip Mafuta
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 Connected Domination Number of Grids [PDF]
, 2021 Closed form expressions for the domination number of an $n \times m$ grid have attracted significant attention, and an exact expression has been obtained in 2011 by Gon alves et al. In this paper, we present our results on obtaining new lower bounds on the connected domination number of an $n \times m$ grid.
Adarsh Srinivasan, N. S. Narayanaswamy
openaire +2 more sources
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