Results 1 to 10 of about 252,092 (282)

Total connected domination game [PDF]

open access: yesOpuscula 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   +3 more sources

Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination [PDF]

open access: yesCombinatorial Algorithms31st International Workshop, 2020
17 pages, improved results, to ...
Lamprou I, Sigalas I, Zissimopoulos V.
europepmc   +8 more sources

The Domination Parameters on a kind of the regular honeycomb structure [PDF]

open access: yesComputer 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

Connected domination value in graphs

open access: yesElectronic Journal of Graph Theory and Applications, 2021
In a connected graph G = (V,E), a set D ⊂ V is a connected dominating set if for every vertex v ∈ V \ D, there exists u ∈ D such that u and v are adjacent, and the subgraph〈D〉induced by D in G is connected.
Angsuman Das
doaj   +1 more source

Connected 2- Dominating Sets and Connected 2- Domination Polynomials of the Complete Bipartite Graph k_(2,m)

open access: yesRatio 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

Rainbow Connection Number and Connected Dominating Sets [PDF]

open access: yesElectronic 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   +4 more sources

Average distance and connected domination

open access: yesAKCE International Journal of Graphs and Combinatorics, 2023
We give a tight upper bound on the average distance of a connected graph of given order in terms of its connected domination number. Our results are a strengthening of a result by DeLaViña, Pepper, and Waller [A note on dominating sets and average ...
P. Mafuta, S. Mukwembi
doaj   +1 more source

Bridge domination in fuzzy graphs [PDF]

open access: yesJournal 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

Connected End Anti-Fuzzy Equitable Dominating Set In Anti-Fuzzy Graphs

open access: yesRatio 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

Categorifying connected domination via graph überhomology

open access: yesJournal of Pure and Applied Algebra, 2023
20 pages, 11 figures and 1 table. Comments are welcome!
Luigi Caputi   +2 more
openaire   +3 more sources

Home - About - Disclaimer - Privacy