Results 241 to 250 of about 313,249 (265)

Domination number of total graphs

Mathematica Slovaca, 2016
Abstract Let R be a commutative ring with Z(R) the set of zero-divisors and U(R) the set of unit elements of R. The total graph of R, denoted by T(Γ(R)), is the (undirected) graph with all elements of R as vertices, and for distinct x, y ∈ R, the vertices x and y are adjacent if and only if x + y ∈ Z(R). We study the domination number of
Shariatinia, A., Maimani, H., Yassemi, S.   +2 more
openaire   +3 more sources

Total and Paired Domination Numbers of Cylinders

Bulletin of the Malaysian Mathematical Sciences Society, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Total Dominator Total Chromatic Numbers of Some Graphs

Utilitas Mathematica
Total 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, Kazemi, Adel P., Kazemnejad, Farshad   +2 more
openaire   +2 more sources

Total Domination Number Versus Matching Number

2013
In 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, 2018
AbstractA 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, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abdollahzadeh Ahangar, H., Khaibari, M., Jafari Rad, N., Sheikholeslami, S. M.   +3 more
openaire   +2 more sources

TOTAL OUTER-CONNECTED DOMINATION SUBDIVISION NUMBERS IN GRAPHS

Discrete Mathematics, Algorithms and Applications, 2013
A 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., Khoeilar, R., Sheikholeslami, S. M.   +2 more
openaire   +2 more sources

New Bounds on the Double Total Domination Number of Graphs

Bulletin of the Malaysian Mathematical Sciences Society, 2021
Abel Cabrera Martínez
exaly  

PENDANT TOTAL DOMINATION NUMBER OF SOME GENERALIZED GRAPHS

Advances and Applications in Discrete Mathematics, 2022
Rani, Jyoti, Mehra, Seema
openaire   +1 more source

Total Version of the Domination Game

Graphs and Combinatorics, 2014
Sandi Klavzar, Douglas F Rall, Michael A Henning   +2 more
exaly