Limited packings: : Related vertex partitions and duality issues
References
[1]
M. Aouchiche, P. Hansen, A survey of Nordhaus-Gaddum type relations, Discrete Appl. Math. 161 (2013) 466–546.
[2]
X. Bai, H. Chang, X. Li, More on limited packings in graphs, J. Comb. Optim. 40 (2020) 412–430.
[3]
B. Brešar, B. Samadi, I.G. Yero, Injective coloring of graphs revisited, Discrete Math. 346 (2023).
[4]
E.J. Cockayne, R.M. Dawes, S.T. Hedetniemi, Total domination in graphs, Networks 10 (1980) 211–219.
[5]
E.J. Cockayne, S.T. Hedetniemi, Towards a theory of domination in graphs, Networks 7 (1977) 247–261.
[6]
A. Gagarin, V. Zverovich, The probabilistic approach to limited packings in graphs, Discrete Appl. Math. 184 (2015) 146–153.
[7]
R. Gallant, G. Gunther, B.L. Hartnell, D.F. Rall, Limited packing in graphs, Discrete Appl. Math. 158 (2010) 1357–1364.
[8]
G. Hahn, J. Kratochvíl, J. Širáň, D. Sotteau, On the injective chromatic number of graphs, Discrete Math. 256 (2002) 179–192.
[9]
R. Hammack, W. Imrich, S. Klavžar, Handbook of Product Graphs, second edition, CRC Press, Boca Raton, FL, 2011.
[10]
F. Harary, T.W. Haynes, Double domination in graphs, Ars Comb. 55 (2000) 201–213.
[11]
F. Harary, T.W. Haynes, The k-tuple domatic number of a graph, Math. Slovaca 48 (1998) 161–166.
[12]
T.W. Haynes, S.T. Hedetniemi, M.A. Henning, Domination in Graphs: Core Concepts, Springer Monographs in Mathematics, Springer, Cham, 2023.
[13]
T.W. Haynes, S.T. Hedetniemi, P.J. Slater, Fundamentals of Domination in Graphs, Marcel Dekker, New York, 1998.
[14]
M.A. Henning, P.J. Slater, Open packing in graphs, J. Comb. Math. Comb. Comput. 28 (1999) 5–18.
[15]
S.M. Hosseini Moghaddam, D.A. Mojdeh, B. Samadi, Total limited packing in graphs, Fasc. Math. 56 (2016) 121–127.
[16]
S.M. Hosseini Moghaddam, D.A. Mojdeh, B. Samadi, L. Volkmann, New bounds on the signed total domination number of graphs, Discuss. Math., Graph Theory 36 (2016) 467–477.
[17]
F. Kramer, H. Kramer, Ein Färbungsproblem der Knotenpunkte eines Graphen bezüglich der Distanz p, Rev. Roum. Math. Pures Appl. 14 (1969) 1031–1038.
[18]
F. Kramer, H. Kramer, Un probleme de coloration des sommets d'un graphe, C. R. Acad. Sci. Paris A 268 (1969) 46–48.
[19]
D.A. Mojdeh, B. Samadi, L. Volkmann, Nordhaus-Gaddum type inequalities for multiple domination and packing parameters in graphs, Contrib. Discrete Math. 15 (2020) 154–162.
[20]
P.K. Niranjan, S. Rao Kola, The k-distance chromatic number of trees and cycles, AKCE Int. J. Graphs Comb. 16 (2019) 230–235.
[21]
E.A. Nordhaus, J. Gaddum, On complementary graphs, Am. Math. Mon. 63 (1956) 175–177.
[22]
B. Samadi, On the k-limited packing numbers in graphs, Discrete Optim. 22 (2016) 270–276.
[23]
B. Samadi, N. Soltankhah, D.A. Mojdeh, Revisiting k-tuple dominating sets with emphasis on small values of k, Bull. Malays. Math. Sci. Soc. 45 (2022) 1473–1487.
[24]
S.M. Sheikholeslami, L. Volkmann, k-tuple total domatic number of a graph, Util. Math. 95 (2014) 189–197.
[25]
L. Volkmann, Bounds on the k-tuple domatic number of a graph, Math. Slovaca 61 (2011) 851–858.
[26]
D.B. West, Introduction to Graph Theory, second edition, Prentice Hall, USA, 2001.
Recommendations
Rainbow Pancyclicity and Panconnectivity of Strongly Edge-Colored Graphs
AbstractAn edge-colored graph is rainbow if no two edges of the graph have the same color. An edge-colored graph is proper if every two adjacent edges receive distinct colors. A strongly edge-colored graph is a proper edge-colored graph such that every ...
More on limited packings in graphs
AbstractA set B of vertices in a graph G is called a k-limited packing if for each vertex v of G, its closed neighbourhood has at most k vertices in B. The k-limited packing number of a graph G, denoted by , is the largest number of vertices in a k-...
A Generalization of Grötzsch Theorem on the Local-Equitable Coloring
AbstractAn equitable k-partition () of a vertex set S is a partition of S into k subsets (may be empty sets) such that the sizes of any two subsets of S differ by at most one. A maximal-m-clique is a clique with m vertices which is not in a larger ...
Comments
Information & Contributors
Information
Published In
Copyright © 2024.
Publisher
Elsevier Science Inc.
United States
Publication History
Published: 01 July 2024
Author Tags
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 23 Feb 2025