𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Characterization of k-variegated graphs, k ⩾ 3

✍ Scribed by Medha Javdekar

Publisher
Elsevier Science
Year
1980
Tongue
English
Weight
415 KB
Volume
32
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Characterizations of 2-variegated graphs
Characterizations of 2-variegated graphs and of 3-variegated graphs
✍ Vasanti N. Bhat-Nayak; S.A. Choudum; Ranjan N. Naik 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 586 KB

A graph is said to be k-variegated if its vertex set can be partiticned into k equal parts such that each vertex is adjacent to exactly one vertex from every othe,r part not co;ltaininT, it. We prove that a graph G on 2n vertices is 2-variegated if and only if there exists a bet S of n independent e

Kneser Graphs Are Hamiltonian For n⩾3k
Kneser Graphs Are Hamiltonian For n⩾3k
✍ Ya-Chen Chen 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 168 KB

The Kneser graph K(n, k) has as vertices the k-subsets of [1, 2, ..., n]. Two vertices are adjacent if the k-subsets are disjoint. In this paper, we prove that K(n, k) is Hamiltonian for n 3k, and extend this to the bipartite Kneser graphs.

A characterization of some {3vμ + 1, 3vμ
A characterization of some {3vμ + 1, 3vμ; k - 1, q}-minihypers and some [n, k, qk-1 - 3qμ; q]-codes (k ⩾ 3, q ⩾ 5, 1 ⩽ μ < k - 1) meeting the Griesmer bound
✍ Noboru Hamada; Tor Helleseth 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 433 KB

For any In, k, d; q]-code the Griesmer bound says that n >t ~ F d/q' 7. The purpose of this paper is to characterize all In, k, qk-1 \_ 3q~; q]-codes meeting the Griesmer bound in the case where k >/3, q >~ 5 and 1 ~</~ < k -1. It is shown that all such codes have a generator matrix whose columns co

The k-Critical 2k-Connected Graphs for k
The k-Critical 2k-Connected Graphs for k∈{3, 4}
✍ Matthias Kriesell 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 180 KB

A noncomplete graph G is called an (n, k)-graph if it is n-connected and G&X is not (n&|X | +1)-connected for any X V(G) with |X | k. Mader conjectured that for k 3 the graph K 2k+2 -(1-factor) is the unique (2k, k)-graph. We settle this conjecture for k 4.