proved that if G is a 2-connected graph with n vertices such that d(u)+d(v)+d(w) n+} holds for any triple of independent vertices u, v, and w, then G is hamiltonian, where } is the vertex connectivity of G. In this note, we will give a short proof of the above result.
โฆ LIBER โฆ
A Theorem on Sum Graphs
โ Scribed by G. Santhosh; G. Suresh Singh
- Book ID
- 108498060
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 66 KB
- Volume
- 15
- Category
- Article
- ISSN
- 1571-0653
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
A Short Proof of a Theorem Concerning De
โ
Bing Wei
๐
Article
๐
1999
๐
Elsevier Science
๐
English
โ 74 KB
On integral sum graphs
โ
Baogen Xu
๐
Article
๐
1999
๐
Elsevier Science
๐
English
โ 375 KB
On Integral Sum Graphs
โ
Zhibo Chen
๐
Article
๐
2002
๐
Elsevier Science
๐
English
โ 408 KB
Remarks on a Zero-Sum Theorem
โ
Yair Caro
๐
Article
๐
1996
๐
Elsevier Science
๐
English
โ 330 KB
Recently the following theorem in combinatorial group theory has been proved: Let G be a finite abelian group and let A be a sequence of members of G such that |A| |G| +D(G)&1, where D(G) is the Davenport constant of G. Then A contains a subsequence B such that |B|= |G| and b # B b=0. We shall prese
A theorem on pancyclic-oriented graphs
โ
Maria Overbeck-Larisch
๐
Article
๐
1977
๐
Elsevier Science
๐
English
โ 275 KB
On zero-sum -flows of graphs
โ
S. Akbari; N. Ghareghani; G.B. Khosrovshahi; A. Mahmoody
๐
Article
๐
2009
๐
Elsevier Science
๐
English
โ 150 KB