Secure Sets and Defensive Alliances in Graphs: A Faster Algorithm and Improved Bounds-Reference-Cited by-同舟云学术

Secure Sets and Defensive Alliances in Graphs: A Faster Algorithm and Improved Bounds

Published:2015 Issue:3 Volume:E98.D Page:486-489
ISSN:0916-8532
Container-title:IEICE Transactions on Information and Systems
language:en
Short-container-title:IEICE Trans. Inf. & Syst.

Author:

AMANO Kazuyuki¹,OO Kyaw May²,OTACHI Yota³,UEHARA Ryuhei³

Affiliation:

1. Depertment of Computer Science, Gunma University

2. University of Computer Studies, Yangon

3. School of Information Science, Japan Advanced Institute of Science and Technology

Publisher

Institute of Electronics, Information and Communications Engineers (IEICE)

Subject

Artificial Intelligence,Electrical and Electronic Engineering,Computer Vision and Pattern Recognition,Hardware and Architecture,Software

Link

https://www.jstage.jst.go.jp/article/transinf/E98.D/3/E98.D_2014FCP0007/_pdf

Reference17 articles.

1. [1] R.C. Brigham, R.D. Dutton, and S.T. Hedetniemi, “Security in graphs,” Discrete Appl. Math., vol.155, pp.1708-1714, 2007.

2. [2] F.R.K. Chung, Z. Füredi, R.L. Graham, and P.D. Seymour, “On induced subgraphs of the cube,” J. Comb. Theory, Ser. A, vol.49, pp.180-187, 1988.

3. [3] R.D. Dutton, “The evolution of a hard graph theory problem — secure sets,” A course material of COT 6410: Computational Complexity, University of Central Florida, 2010. Available at http://www.cs.ucf.edu/courses/cot6410/spr2010/doc/SecureSets.doc

4. [4] R.D. Dutton, “On a graph's security number,” Discrete Math., vol.309, pp.4443-4447, 2009.

5. [5] R.D. Dutton, R. Lee, and R.C. Brigham, “Bounds on a graph's security number,” Discrete Appl. Math., vol.156, pp.695-704, 2008.

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

1. On the security number of the Cartesian product of graphs;Discrete Applied Mathematics;2021-12