MINIMALLY (n, λ)-CONNECTED GRAPHS OF LOW ORDER AND MAXIMAL SIZE  

MINIMALLY (n, λ)-CONNECTED GRAPHS OF LOW ORDER AND MAXIMAL SIZE

在线阅读下载全文

作  者:XU Liqiong GUO Xiaofeng 

机构地区:[1]School of Mathematical Sciences, Xiamen University, Xiamen 361005 [2]Institute of Mathematics and Computer Science, Fujian Normal University, Fuzhou 350007, China [3]School of Mathematical Sciences, Xiamen University, Xiamen 361005, China.

出  处:《Journal of Systems Science & Complexity》2005年第4期564-569,共6页系统科学与复杂性学报(英文版)

基  金:This research is supported by the National Natural Science Foundation of China.

摘  要:A. Kaneko and K. Ota proved that for a minimally (n, λ)-connected graph G, if |G| = p ≥ 3n - 1, then e(G) ≤ nλ(|G| - n); and if e(G) = nλ(|G| - n), then G is isomorphic to the graph Kn^λ,p-n which is obtained from the complete bipartite graph Kn,p-n by replacing each edge with A multiple edges; if 3n - 1 ≥ |G}≥ n + 1, then e(G) ≤λ(|G| + n)^2/8. In this paper, we determine all the minimally (n, λ)-connected graphs with order p and the maximum size λ(p+n)^2/8 for 3n- 1 ≥ p ≥ n+ 1 for 3n-1≥p≥n+1.

关 键 词:(n λ )-connectivity minimally (n λ )-connected graph minimally k-connected graph. 

分 类 号:O157.5[理学—数学]

 

参考文献:

正在载入数据...

 

二级参考文献:

正在载入数据...

 

耦合文献:

正在载入数据...

 

引证文献:

正在载入数据...

 

二级引证文献:

正在载入数据...

 

同被引文献:

正在载入数据...

 

相关期刊文献:

正在载入数据...

相关的主题
相关的作者对象
相关的机构对象