Presentation 2013/3/11
On the eternal vertex cover number of trees composed of elementary bipartite graphs
Shouta INOUE, Hisashi ARAKI, Toshihiro FUJITO,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Suppose, when some number of guards are placed on some vertices in graph G'one of its edges is attacked. If a guard is placed on one of the end-vertices of the attacked edge, he can protect G from such an attack by passing over the attacked edge. For each of such attacks, every guard is allowed either to move to a neighboring vertex, or to stay at where he is. The eternal vertex cover number is the minimum number of guards sufficient to protect G from any number of and any sequence of edge attacks. This paper derives the eternal vertex cover number of such graphs constructed by replacing each edge of a tree by an arbitrary elementary bipartite graph.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Eternal vertex cover number / Elementary bipartite graphs
Paper # C0MP2012-52
Date of Issue

Conference Information
Committee COMP
Conference Date 2013/3/11(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Theoretical Foundations of Computing (COMP)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) On the eternal vertex cover number of trees composed of elementary bipartite graphs
Sub Title (in English)
Keyword(1) Eternal vertex cover number
Keyword(2) Elementary bipartite graphs
1st Author's Name Shouta INOUE
1st Author's Affiliation Department of Computer Science and Engineering Toyohashi University of Technology()
2nd Author's Name Hisashi ARAKI
2nd Author's Affiliation Department of Computer Science and Engineering Toyohashi University of Technology
3rd Author's Name Toshihiro FUJITO
3rd Author's Affiliation Department of Computer Science and Engineering Toyohashi University of Technology
Date 2013/3/11
Paper # C0MP2012-52
Volume (vol) vol.112
Number (no) 498
Page pp.pp.-
#Pages 4
Date of Issue