Aug 2026· Mathematics· Vol 14, pp. 2917· 1 citation· 22 references
Abstract
Domination is among the most popular topics in graph theory, both due to its combinatorial appeal and a number of practical applications. Cylindrical graphs are Cartesian products of a path and a cycle. Usually, for some special subfamilies, natural constructions exist that give exact solutions. On the other hand, in general, exact values of invariants on cylindrical graphs are hard to compute. In this paper, tight lower and upper bounds for singleton three-rainbow domination are proven and a subfamily of cylindrical graphs is found for which exact values are provided. The results complement recent findings for singleton two- and four-rainbow domination.
For a subgraph of a vertex set of a graph to be strong efficient, all remaining vertices in the graph must have exactly one neighbor of equal or greater degree in the specified subgraph and all vertices in the specified subgraph are independent of each other. The strong efficient domination number is the cardinality of...
Betul Atay· Communications faculty of sc...· 0 citations
A semitotal dominating set of a nontrivial connected graph G is a dominating set D of G such that every vertex in D is within distance two of another vertex in D. The semitotal domination number of G is the minimum cardinality among all semitotal dominating sets of G. In this article, we investigate the semitotal domin...
A. Cabrera-Martínez, J. L. López-Carmona, José M. Rodríguez et al.· Asian-European Journal of Ma...· 0 citations
A graph is
perfect
if, for every induced subgraph, the chromatic number equals the size of its largest clique. In 1972, Lovász established a fundamental characterization of perfect graphs, showing that a graph is perfect if and only if, for every induced subgraph, the product of the size of the largest independen...
This survey reviews recent results on the disjunctive domination numbers and the disjunctive total domination numbers in graphs. Tight bounds and exact values are presented for trees, grids, and Harary graphs. The ratio [Formula: see text] is analyzed for various graph families, where [Formula: see text] and [Formula:...
Jun Yue, Tian-Zi Huang· Journal of Interconnection N...· 0 citations
We study the number of minimal transitive factorizations of the identity permutation in $S_n$ into transpositions supported on a quasi-threshold graph. We show that this number is always divisible by $(2n-2)!/n!$, which is the factorization count for a star graph, as shown by Irving and Rattan. To prove this, we give a...
Cordelia Yuqiao Li, Ricky Ini Liu· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.