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 2026-03-04 10:30
An upper bound for the double domination number of maximal outerplanar graphs
Toru Araki (Gunma Univ) COMP2025-22
Abstract (in Japanese) (See Japanese page) 
(in English) In a graph $G$, a vertex dominates itself and its neighbors.
A subset $S$ of vertices of $G$ is a double dominating set of $G$ if
every vertex is dominated by at least two vertices in $S$.
The double domination number $gamma_{times 2}(G)$ of $G$ is the
minimum cardinality of a double dominating set of $G$.
In this paper, we prove that, for a maximal outerplanar graph $G$,
the double domination number $gamma_{times 2}(G)$ is at most
$(n+k)/2$, where $k$ is the number of pairs of consecutive on the
outer cycle but at distance at least 3.
Although this bound was previously proposed by Abd Aziz, Rad and
Kamarulhaili (A note on the double domination number in maximal
outerplanar and planar graphs, RAIRO Operations Research, 56 (2022)
3367--3371), their proof was found to be incomplete.
In this paper we establish the validity of this result by providing a complete proof.
Keyword (in Japanese) (See Japanese page) 
(in English) double dominating set / dominating set / maximal outerplanar graph / upper bound / / / /  
Reference Info. IEICE Tech. Rep., vol. 125, no. 390, COMP2025-22, pp. 5-12, March 2026.
Paper # COMP2025-22 
Date of Issue 2026-02-25 (COMP) 
ISSN 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 COMP2025-22

Conference Information
Committee COMP  
Conference Date 2026-03-04 - 2026-03-04 
Place (in Japanese) (See Japanese page) 
Place (in English) Chuo University Korakuen Campus Building 6 4F Room 6402 
Topics (in Japanese) (See Japanese page) 
Topics (in English) Theoretical Computer Science, General 
Paper Information
Registration To COMP 
Conference Code 2026-03-COMP 
Language English (Japanese title is available) 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) An upper bound for the double domination number of maximal outerplanar graphs 
Sub Title (in English)  
Keyword(1) double dominating set  
Keyword(2) dominating set  
Keyword(3) maximal outerplanar graph  
Keyword(4) upper bound  
Keyword(5)  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Toru Araki  
1st Author's Affiliation Gunma University (Gunma Univ)
2nd Author's Name  
2nd Author's Affiliation ()
3rd Author's Name  
3rd Author's Affiliation ()
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 2026-03-04 10:30:00 
Presentation Time 30 minutes 
Registration for COMP 
Paper # COMP2025-22 
Volume (vol) vol.125 
Number (no) no.390 
Page pp.5-12 
#Pages 8 
Date of Issue 2026-02-25 (COMP) 

[Return to Top Page]

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