Bounds on a graph's security number-Reference-Cited by-同舟云学术

Bounds on a graph's security number

Published:2008-03 Issue:5 Volume:156 Page:695-704
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Dutton Ronald D.,Lee Robert,Brigham Robert C.

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference15 articles.

1. Unfriendly partitions of graphs;Aharoni;J. Combin. Theory B,1990

2. R.C. Brigham, R.D. Dutton, T.W. Haynes, S.T. Hedetniemi, Powerful alliances in graphs, April 2004, submitted for publication.

3. R.C. Brigham, R.D. Dutton, S.T. Hedetniemi, A sharp lower bound on the powerful alliance number of Cm□Cn, Congr. Numer. (2004) 57–63.

4. R.C. Brigham, R.D. Dutton, S.T. Hedetniemi, Security in graphs, Discrete Appl. Math., to appear.

5. O. Favaron, G. Fricke, W. Goddard, S.M. Hedetniemi, S.T. Hedetniemi, P. Kristiansen, R.C. Laskar, D. Skaggs, Offensive alliances in graphs, in: I. Cicekli, N.K. Cicekli, E. Gelenbe (Eds.), Proceedings of the 17th International Symposium on Computer and Information Sciences, ISCIS, vol. XVII, October 28–30, 2002, Orlando, FL, CRC Press, Boca Raton, FL, pp. 298–302.

Cited by 22 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. k-Secure Sets and k-Security Number of a Graph;COMMUN COMB OPTIM;2023

2. A study on S2-secure set of Transformation Graphs of a Path;Materials Today: Proceedings;2023-05

3. k-distance secure sets in graphs;Materials Today: Proceedings;2023-05

4. Security in Sierpiński graphs;Discrete Applied Mathematics;2023-03

5. Secure domination of some graph operators;Indian Journal of Pure and Applied Mathematics;2022-10-04