✦ LIBER ✦

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

✍ Scribed by Yin, Jianhua; Guo, Guodong

Book ID: 118747176
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 380 KB
Volume: 34
Category: Article
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2013.01.001

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 PotentiallyKr+1−K3-Graphic Sequences

✍ Meng-xiao Yin 📂 Article 📅 2006 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 154 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

MAGNA CARTAThe Great CharterPreamble

📂 Fiction 🌐 English ⚖ 11 KB 👁 18 views