Name
Abstract | ||
|---|---|---|
Given a graph G, for an integer c@?{2,...,|V(G)|}, define @l\"c(G)=min{|X|:X@?E(G),@w(G-X)=c}. For a graph G and for an integer c=1,2,...,|V(G)|-1, define, @t\"c(G)=minX@?E(G) and @w(G-X)c|X|@w(G-X)-c, where the minimum is taken over all subsets X of E(G) such that @w(G-X)-c0. In this paper, we establish a relationship between @l\"c(G) and @t\"c\"-\"1(G), which gives a characterization of the edge-connectivity of a graph G in terms of the spanning tree packing number of subgraphs of G. The digraph analogue is also obtained. The main results are applied to show that if a graph G is s-hamiltonian, then L(G) is also s-hamiltonian, and that if a graph G is s-hamiltonian-connected, then L(G) is also s-hamiltonian-connected. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.disc.2007.11.056 | Discrete Mathematics |
Keywords | Field | DocType |
s -hamiltonian,higher order of edge-connectivity,spanning tree packing number,s -hamiltonian-connected,k-arc-connected digraphs,k -arc-connected digraphs,higher order of edge-toughness,s-hamiltonian,line graph,edge-connectivity,spanning arborescences,s-hamiltonian-connected,k,s,higher order,spanning tree | Integer,Discrete mathematics,Combinatorics,Disjoint sets,Line graph,Bound graph,Hamiltonian path,Directed graph,Spanning tree,Connectivity,Mathematics | Journal |
Volume | Issue | ISSN |
309 | 5 | Discrete Mathematics |
Citations | PageRank | References |
17 | 1.71 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Paul A. Catlin | 1 | 514 | 66.29 |
| Hong-Jian Lai | 2 | 631 | 97.39 |
| Yehong Shao | 3 | 102 | 14.70 |