Information: Join today and make your research activities more affordable! Technical workshop participation fees and annual registration fees are available at member rates.
Notice: [Important] Announcement of Changes to Registration Fee Payment and Manuscript Upload Procedures for IEICE Technical Meetings
IEICE Technical Committee Submission System
Conference Paper's Information		 Online Proceedings
[Sign in]
Tech. Rep. Archives
 Go Top Page Go Previous   [Japanese] / [English] 

Paper Abstract and Keywords
Presentation 2013-03-18 09:55
On the eternal vertex cover number of trees composed of elementary bipartite graphs
Shota Inoue, Hisashi Araki, Toshihiro Fujito (Toyohashi Univ. of Tech) COMP2012-52
Abstract (in Japanese) (See Japanese page) 
(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) 
(in English) eternal vertex cover number / elementary bipartite graphs / / / / / /  
Reference Info. IEICE Tech. Rep., vol. 112, no. 498, COMP2012-52, pp. 1-4, March 2013.
Paper # COMP2012-52 
Date of Issue 2013-03-11 (COMP) 
ISSN Print edition: ISSN 0913-5685    Online edition: ISSN 2432-6380
Copyright
and
reproduction		 All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
Download PDF COMP2012-52

Conference Information
Committee COMP  
Conference Date 2013-03-18 - 2013-03-18 
Place (in Japanese) (See Japanese page) 
Place (in English) Gifu University 
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To COMP 
Conference Code 2013-03-COMP 
Language Japanese 
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  
Keyword(3)  
Keyword(4)  
Keyword(5)  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Shota Inoue  
1st Author's Affiliation Toyohashi University of Technology (Toyohashi Univ. of Tech)
2nd Author's Name Hisashi Araki  
2nd Author's Affiliation Toyohashi University of Technology (Toyohashi Univ. of Tech)
3rd Author's Name Toshihiro Fujito  
3rd Author's Affiliation Toyohashi University of Technology (Toyohashi Univ. of Tech)
4th Author's Name  
4th Author's Affiliation ()
5th Author's Name  
5th Author's Affiliation ()
6th Author's Name  
6th Author's Affiliation ()
7th Author's Name  
7th Author's Affiliation ()
8th Author's Name  
8th Author's Affiliation ()
9th Author's Name  
9th Author's Affiliation ()
10th Author's Name  
10th Author's Affiliation ()
11th Author's Name  
11th Author's Affiliation ()
12th Author's Name  
12th Author's Affiliation ()
13th Author's Name  
13th Author's Affiliation ()
14th Author's Name  
14th Author's Affiliation ()
15th Author's Name  
15th Author's Affiliation ()
16th Author's Name  
16th Author's Affiliation ()
17th Author's Name  
17th Author's Affiliation ()
18th Author's Name  
18th Author's Affiliation ()
19th Author's Name  
19th Author's Affiliation ()
20th Author's Name  
20th Author's Affiliation ()
21st Author's Name  
21st Author's Affiliation ()
22nd Author's Name  
22nd Author's Affiliation ()
23rd Author's Name  
23rd Author's Affiliation ()
24th Author's Name  
24th Author's Affiliation ()
25th Author's Name  
25th Author's Affiliation ()
26th Author's Name / /
26th Author's Affiliation ()
()
27th Author's Name / /
27th Author's Affiliation ()
()
28th Author's Name / /
28th Author's Affiliation ()
()
29th Author's Name / /
29th Author's Affiliation ()
()
30th Author's Name / /
30th Author's Affiliation ()
()
31st Author's Name / /
31st Author's Affiliation ()
()
32nd Author's Name / /
32nd Author's Affiliation ()
()
33rd Author's Name / /
33rd Author's Affiliation ()
()
34th Author's Name / /
34th Author's Affiliation ()
()
35th Author's Name / /
35th Author's Affiliation ()
()
36th Author's Name / /
36th Author's Affiliation ()
()
Speaker Author-1 
Date Time 2013-03-18 09:55:00 
Presentation Time 25 minutes 
Registration for COMP 
Paper # COMP2012-52 
Volume (vol) vol.112 
Number (no) no.498 
Page pp.1-4 
#Pages 4 
Date of Issue 2013-03-11 (COMP) 

[Return to Top Page]

[Return to IEICE Web Page]
The Institute of Electronics, Information and Communication Engineers (IEICE), Japan