✦ LIBER ✦

Mutually Independent Hamiltonian Connectivity of (n,k)-Star Graphs

✍ Scribed by Selina Yo-Ping Chang; Justie Su-Tzu Juan; Cheng-Kuan Lin; Jimmy J. M. Tan; Lih-Hsing Hsu

Publisher: Springer
Year: 2009
Tongue: English
Weight: 442 KB
Volume: 13
Category: Article
ISSN: 0218-0006
DOI: 10.1007/s00026-009-0011-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fault Hamiltonicity and fault Hamiltonia

Fault Hamiltonicity and fault Hamiltonian connectivity of the (n, k)-star graphs

✍ Hong-Chun Hsu; Yi-Lin Hsieh; Jimmy J. M. Tan; Lih-Hsing Hsu 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 252 KB

Circumferences of k-connected graphs inv

Circumferences of k-connected graphs involving independence numbers

✍ Guantao Chen; Zhiquan Hu; Yaping Wu 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 211 KB 👁 1 views

Let G be a k-connected graph of order n, := (G) the independence number of G, and c(G) the circumference of G. Chvátal and Erdo ˝s proved that if ≤ k then G is hamiltonian. For ≥ k ≥ 2, Fouquet and Jolivet in 1978 made the conjecture that c(G) ≥ k(n+ -k) / . Fournier proved that the conjecture is tr

Hamiltonian circuits in N2-locally conne

Hamiltonian circuits in N2-locally connected K1,3-free graphs

✍ ZdeněK Ryjáček 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 407 KB 👁 1 views

## Abstract There are many results concerned with the hamiltonicity of __K__~1,3~‐free graphs. In the paper we show that one of the sufficient conditions for the __K__~1,3~‐free graph to be Hamiltonian can be improved using the concept of second‐type vertex neighborhood. The paper is concluded with

Connectivity of the mutual k-nearest-nei

Connectivity of the mutual k-nearest-neighbor graph in clustering and outlier detection

✍ M.R. Brito; E.L. Chávez; A.J. Quiroz; J.E. Yukich 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 610 KB

For multivariate data sets, we study the relationship between the connectivity of a mutual k-nearest-neighbor graph, and the presence of clustering structure and outliers in the data. A test for detection of clustering structure and outliers is proposed and its performance is evaluated in simulated

Disproof of a conjecture about independe

Disproof of a conjecture about independent branchings in k-connected directed graphs

✍ Andreas Huck 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 248 KB 👁 1 views

## Abstract For each __k__ ≥ 3, we construct a finite directed strongly __k__‐connected graph __D__ containing a vertex __t__ with the following property: For any __k__ spanning __t__‐branchings, __B__~1~, …, __B__~__k__~ in __D__ (i. e., each __B__~__i__~ is a spanning tree in __D__ directed towar

The existence of a 2-factor in K1, n-fre

The existence of a 2-factor in K1, n-free graphs with large connectivity and large edge-connectivity

✍ R. E. L. Aldred; Yoshimi Egawa; Jun Fujisawa; Katsuhiro Ota; Akira Saito 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 130 KB 👁 1 views

In this article, we study the existence of a 2-factor in a K 1,nfree graph. Sumner [J London Math Soc 13 (1976), 351-359] proved that for n ≥ 4, an (n-1)-connected K 1,n -free graph of even order has a 1-factor.