On the Eternal Vertex Cover Numbers of Generalized Trees-Reference-Cited by-同舟云学术

On the Eternal Vertex Cover Numbers of Generalized Trees

Published:2015 Issue:6 Volume:E98.A Page:1153-1160
ISSN:0916-8508
Container-title:IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
language:en
Short-container-title:IEICE Trans. Fundamentals

Author:

ARAKI Hisashi¹,FUJITO Toshihiro¹,INOUE Shota¹

Affiliation:

1. Department of Computer Science and Engineering, Toyohashi University of Technology

Publisher

Institute of Electronics, Information and Communications Engineers (IEICE)

Subject

Applied Mathematics,Electrical and Electronic Engineering,Computer Graphics and Computer-Aided Design,Signal Processing

Link

https://www.jstage.jst.go.jp/article/transfun/E98.A/6/E98.A_1153/_pdf

Reference12 articles.

1. [1] M. Anderson, C. Barrientos, R. Brigham, J. Carrington, R. Vitray, and J. Yellen, “Maximum demand graphs for eternal security,” J. Comb. Math. Comb. Comput., vol.61, pp.111-128, 2007.

2. [2] A.P. Burger, E.J. Cockayne, W.R. Gründlingh, C.M. Mynhardt, J.H. van Vuuren, and W. Winterback, “Infinite order domination in graphs,” J. Comb. Math. Comb. Comput., vol.50, pp.179-194, 2004.

3. [3] J.A. Bondy and U.S.R. Murty, Graph Theory, Springer, 2008.

4. [4] E.J. Cockayne, P.A. Dreyer, S.M. Hedetniemi, and S.T. Hedetniemi, “Roman domination in graphs,” Discrete Math., vol.278, pp.11-22, 2004.

5. [5] F.V. Fomin, S. Gaspers, P.A. Golovach, D. Kratsch, and S. Saurabh, “Parameterized algorithm for eternal vertex cover,” Inform. Process. Lett., vol.110, pp.702-706, 2010.

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

1. Stability of Vertex Covers in a Game with Finitely Many Steps;Journal of Applied and Industrial Mathematics;2024-06

2. Eternal Connected Vertex Cover Problem in Graphs: Complexity and Algorithms;Lecture Notes in Computer Science;2024

3. Some Algorithmic Results for Eternal Vertex Cover Problem in Graphs;WALCOM: Algorithms and Computation;2023

4. Eternal Vertex Cover on Bipartite Graphs;Computer Science – Theory and Applications;2022

5. A substructure based lower bound for eternal vertex cover number;Theoretical Computer Science;2021-10