Paper Abstract and Keywords |
Presentation |
2005-03-18 14:35
A lower bound for the vertex isoperimetric number of the complete k-ary tree Yota Otachi, Kaori Umezawa, Koichi Yamazaki (Gunma Univ.) |
Abstract |
(in Japanese) |
(See Japanese page) |
(in English) |
The vertex isoperimetric number problem (for short VINP) is to determine the value of vi(G)= max_{1 \le k \le |V|} min_{|S| = k} \Gamma(S) for a given graph G=(V,E), where \Gamma(S) = {v \not\in S | \exists u \in S s.t. {u,v} \in E}. In this paper, we show a lower bound for vertex isoperimetric number of the complete k-ary trees. |
Keyword |
(in Japanese) |
(See Japanese page) |
(in English) |
vertex isoperimetric number / complete k-ary tree / / / / / / |
Reference Info. |
IEICE Tech. Rep., vol. 104, no. 743, COMP2004-80, pp. 57-60, March 2005. |
Paper # |
COMP2004-80 |
Date of Issue |
2005-03-11 (COMP) |
ISSN |
Print edition: ISSN 0913-5685 |
Download PDF |
|
Conference Information |
Committee |
COMP |
Conference Date |
2005-03-18 - 2005-03-18 |
Place (in Japanese) |
(See Japanese page) |
Place (in English) |
Tokyo Institute of Technology |
Topics (in Japanese) |
(See Japanese page) |
Topics (in English) |
|
Paper Information |
Registration To |
COMP |
Conference Code |
2005-03-COMP |
Language |
English (Japanese title is available) |
Title (in Japanese) |
(See Japanese page) |
Sub Title (in Japanese) |
(See Japanese page) |
Title (in English) |
A lower bound for the vertex isoperimetric number of the complete k-ary tree |
Sub Title (in English) |
|
Keyword(1) |
vertex isoperimetric number |
Keyword(2) |
complete k-ary tree |
Keyword(3) |
|
Keyword(4) |
|
Keyword(5) |
|
Keyword(6) |
|
Keyword(7) |
|
Keyword(8) |
|
1st Author's Name |
Yota Otachi |
1st Author's Affiliation |
Gunma University (Gunma Univ.) |
2nd Author's Name |
Kaori Umezawa |
2nd Author's Affiliation |
Gunma University (Gunma Univ.) |
3rd Author's Name |
Koichi Yamazaki |
3rd Author's Affiliation |
Gunma University (Gunma Univ.) |
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 |
() |
Speaker |
Author-1 |
Date Time |
2005-03-18 14:35:00 |
Presentation Time |
25 minutes |
Registration for |
COMP |
Paper # |
COMP2004-80 |
Volume (vol) |
vol.104 |
Number (no) |
no.743 |
Page |
pp.57-60 |
#Pages |
4 |
Date of Issue |
2005-03-11 (COMP) |