✦ LIBER ✦

The Smallest Degree Sum That Yields PotentiallyKr+1−K3-Graphic Sequences

✍ Scribed by Meng-xiao Yin

Book ID: 106301169
Publisher: Institute of Applied Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year: 2006
Tongue: English
Weight: 154 KB
Volume: 22
Category: Article
ISSN: 0168-9673
DOI: 10.1007/s10255-006-0321-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The smallest degree sum that yields pote

The smallest degree sum that yields potentially Kr,r-graphic sequences

✍ Jianhua Yin; Jiongsheng Li 📂 Article 📅 2002 🏛 SP Science China Press 🌐 English ⚖ 268 KB

The smallest degree sum that yields pote

The smallest degree sum that yields potentiallyPk-graphical sequences

✍ Jiong-Sheng, Li; Zi-Xia, Song 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 354 KB 👁 2 views

A simple graph G is said to have property P k if it contains a complete subgraph of order k + 1, and a sequence π is potentially P k -graphical if it has a realization having property P k . Let σ(k, n) denote the smallest degree sum such that every n-term graphical sequence π without zero terms and

The smallest degree sum that yields grap

The smallest degree sum that yields graphic sequences with a -connected realization

✍ Yin, Jianhua; Guo, Guodong 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 380 KB