✦ LIBER ✦

Sequences of degrees of edges of self-complementary graphs

✍ Scribed by Zh. A. Chernyak

Publisher: SP MAIK Nauka/Interperiodica
Year: 1983
Tongue: English
Weight: 596 KB
Volume: 34
Category: Article
ISSN: 0001-4346
DOI: 10.1007/bf01141783

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The degree sequences of self-complementa

The degree sequences of self-complementary graphs

✍ C.R.J Clapham; D.J Kleitman 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 418 KB

Coloring edges of self-complementary gra

Coloring edges of self-complementary graphs

✍ A.Paweł Wojda; Małgorzata Zwonek 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 362 KB

We prove that the self-complementary graphs having cyclic complementing permutation are Class 1 and that the regular self-complementary graphs are Class 2. We conjecture that a selfcomplementary graph is Class 2 if and only if it is regular.

Sums of Powers of the Degrees of Graphs

Sums of Powers of the Degrees of Graphs withkCut Edges

✍ Shuchao Li; Lixia Yan 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 298 KB

Characterisation of self-complementary c

Characterisation of self-complementary chordal graphs

✍ M.R. Sridharan; K. Balaji 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 208 KB

and only if its clique number is integral part of (p + 1)/2.

On low bound of degree sequences of span

On low bound of degree sequences of spanning trees inK-edge-connected graphs

✍ Zhenhong, Liu; Baoguang, Xu 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 257 KB 👁 3 views

[•] is a lower integer form and α depends on k. We show that every k-edge-connected graph with k ≥ 2, has a d k -tree, and α = 1 for k = 2, α = 2 for k ≥ 3.

Signed degree sequences of signed graphs

✍ Yan, Jing-Ho; Lih, Ko-Wei; Kuo, David; Chang, Gerard J. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 105 KB 👁 2 views

sequence to be the signed degree sequence of a signed graph or a signed tree, answering a question raised by