Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Farshad Kazemnejad"'
Publikováno v:
Transactions on Combinatorics, Vol 12, Iss 2, Pp 79-91 (2023)
In this paper, we study the domination number of middle graphs. Indeed, we obtain tight bounds for this number in terms of the order of the graph G. We also compute the domination number of some families of graphs such as star graphs, double start gr
Externí odkaz:
https://doaj.org/article/6a008674255043fc83b9af61320dbfc1
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 19, Iss 3, Pp 229-237 (2022)
AbstractFor a graph [Formula: see text] we call a subset [Formula: see text] a total mixed dominating set of G if each element of [Formula: see text] is either adjacent or incident to an element of S, and the total mixed domination number of G is the
Externí odkaz:
https://doaj.org/article/72d19692b4c64c4885e8658329c36bd4
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 10, Iss 1, Pp 275-288 (2022)
A total dominating set of a graph G with no isolated vertices is a subset S of the vertex set such that every vertex of G is adjacent to a vertex in S. The total domination number of G is the minimum cardinality of a total dominating set. In this pap
Externí odkaz:
https://doaj.org/article/bb1602dc538242259d435aaf778c64c5
Autor:
Adel P. Kazemi, Farshad Kazemnejad
The 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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4f34c89b514e13943390b73d95f947ad
http://arxiv.org/abs/1912.01402
http://arxiv.org/abs/1912.01402