Results 11 to 20 of about 34 (28)
Edge subdivision and edge multisubdivision versus some domination related parameters in generalized corona graphs [PDF]
Opuscula Mathematica, 2016 Given a graph \(G=(V,E)\), the subdivision of an edge \(e=uv\in E(G)\) means the substitution of the edge \(e\) by a vertex \(x\) and the new edges \(ux\) and \(xv\).
Magda Dettlaff +2 more
doaj +1 more source
Changing of the domination number of a graph: edge multisubdivision and edge removal [PDF]
Mathematica Bohemica, 2017 For a graphical property $\mathcal{P}$ and a graph $G$, a subset $S$ of vertices of $G$ is a $\mathcal{P}$-set if the subgraph induced by $S$ has the property $\mathcal{P}$.
Vladimir Samodivkin
doaj +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Paired domination subdivision and multisubdivision numbers of graphs
Journal of Combinatorial Mathematics and Combinatorial Computing, 2020The paired domination subdivision number sdpr(G) of a graph G is the minimum number of edges that must be subdivided (where an edge can be subdivided at most once) in order to increase the paired domination number of G. We prove that the decision problem of the paired domination subdivision number is NP-complete even for bipartite graphs.
openaire +1 more source
Semitotal Domination Multisubdivision Number of a Graph
Iranian Journal of Science, 2023openaire +1 more source
Varieties of Roman domination II
AKCE International Journal of Graphs and Combinatorics, 2020Mustapha Chellali +2 more
exaly
Total Roman {2}-domination in graphs
Quaestiones Mathematicae, 2021Suitberto Cabrera Garcia +2 more
exaly
Domination in fuzzy graphs – I
Pattern Recognition Letters, 1998A Somasundaram, S Somasundaram
exaly