Results 261 to 270 of about 11,484 (286)
Some of the next articles are maybe not open access.
Total Dominator Total Chromatic Numbers of Some Graphs
Utilitas MathematicaTotal dominator total coloring of a graph is a total coloring of the graph such that each object of the graph is adjacent or incident to every object of some color class. The minimum namber of the color classes of a total dominator total coloring of a graph is called the total dominator total chromatic number of the graph.
Vusuqi, Leila +2 more
openaire +2 more sources
Total Domination Number Versus Matching Number
2013In the metadata of the chapter that will be visualized online, please make the following change: “In this chapter, we relate the total domination number of a graph with its matching number”
Michael A. Henning, Anders Yeo
openaire +1 more source
Graphs with equal secure total domination and inverse secure total domination numbers
Journal of Information and Optimization Sciences, 2018AbstractA secure total dominating set of a graph G = (V, E) is a total dominating set D ⊆ V(G) with the property that for each u ∈ V(G) – D, there exists v ∈ D adjacent to u such that (D – {v}) ∪ {u} is a total dominating set. If V(G) – D contains a secure total dominating set D´ of G, then D´ is called an inverse secure total dominating set with ...
V. R. Kulli, B. Chaluvaraju, M. Kumara
openaire +1 more source
Graphs with Large Total 2-Rainbow Domination Number
Iranian Journal of Science and Technology, Transactions A: Science, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abdollahzadeh Ahangar, H. +3 more
openaire +2 more sources
TOTAL OUTER-CONNECTED DOMINATION SUBDIVISION NUMBERS IN GRAPHS
Discrete Mathematics, Algorithms and Applications, 2013A set S of vertices of a graph G is a total outer-connected dominating set if every vertex in V(G) is adjacent to some vertex in S and the subgraph G[V\S] induced by V\S is connected. The total outer-connected domination numberγ toc (G) is the minimum size of such a set.
Favaron, O. +2 more
openaire +2 more sources
Graphs with large total domination number
Journal of Graph Theory, 2000A subset \(S\) of the vertex set \(V(G)\) of a graph \(G\) is called total dominating in \(G\), if each vertex of \(G\) is adjacent to a vertex of \(S\). The minimum number of vertices of a total dominating set in \(G\) is the total domination number \(\gamma_t(G)\) of \(G\).
openaire +2 more sources
PENDANT TOTAL DOMINATION NUMBER OF SOME GENERALIZED GRAPHS
Advances and Applications in Discrete Mathematics, 2022Rani, Jyoti, Mehra, Seema
openaire +1 more source