Dominating 2-broadcast in graphs: complexity, bounds and extremal graphs
暂无分享,去创建一个
Ignacio M. Pelayo | Carmen Hernando | Merce Mora | M. L. Puertas | C. Hernando | M. Mora | I. Pelayo | Jos'e C'aceres | Mar'ia Luz Puertas | J. C'aceres
[1] Haitze J. Broersma. Existence of Δλ-cycles and Δλ-paths , 1988, J. Graph Theory.
[2] Michael S. Jacobson,et al. Minimum Degree and Dominating Paths , 2017, J. Graph Theory.
[3] Fred R. McMorris,et al. Graphs with only caterpillars as spanning trees , 2003, Discret. Math..
[4] Pinar Heggernes,et al. Optimal broadcast domination in polynomial time , 2006, Discret. Math..
[5] Nader Jafari Rad,et al. Limited Dominating Broadcast in graphs , 2013, Discret. Math. Algorithms Appl..
[6] Claude Berge,et al. The theory of graphs and its applications , 1962 .
[7] G. Dirac. Some Theorems on Abstract Graphs , 1952 .
[8] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[9] Peter J. Slater,et al. Fundamentals of domination in graphs , 1998, Pure and applied mathematics.
[10] F. Harary,et al. On Eulerian and Hamiltonian Graphs and Line Graphs , 1965, Canadian Mathematical Bulletin.
[11] F. Harary,et al. The theory of graphs and its applications , 1963 .
[12] Henk Jan Veldman,et al. Existence of dominating cycles and paths , 1983, Discret. Math..
[13] Christina M. Mynhardt,et al. A class of trees with equal broadcast and domination numbers , 2013, Australas. J Comb..
[14] Eugene L. Lawler,et al. Linear-Time Computation of Optimal Subgraphs of Decomposable Graphs , 1987, J. Algorithms.
[15] Sarada Herke,et al. Broadcasts and domination in trees , 2011, Discret. Math..
[16] C. L. Liu,et al. Introduction to Combinatorial Mathematics. , 1971 .