✦ LIBER ✦

Connectivity of the Mycielskian of a graph

✍ Scribed by R. Balakrishnan; S. Francis Raj

Book ID: 108113833
Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 125 KB
Volume: 308
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.05.004

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Super Connectivity and Super Edge Connec

Super Connectivity and Super Edge Connectivity of the Mycielskian of a Graph

✍ Litao Guo; Ruifang Liu; Xiaofeng Guo 📂 Article 📅 2011 🏛 Springer Japan 🌐 English ⚖ 115 KB

Connectivity of the Mycielskian of a dig

Connectivity of the Mycielskian of a digraph

✍ Litao Guo; Xiaofeng Guo 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 383 KB

Multi-coloring the Mycielskian of graphs

✍ Wensong Lin; Daphne Der-Fen Liu; Xuding Zhu 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 129 KB

## Abstract A __k__‐fold coloring of a graph is a function that assigns to each vertex a set of __k__ colors, so that the color sets assigned to adjacent vertices are disjoint. The __k__th chromatic number of a graph __G__, denoted by χ~__k__~(__G__), is the minimum total number of colors used in a

The rainbow connectivity of a graph

✍ Gary Chartrand; Garry L. Johns; Kathleen A. McKeon; Ping Zhang 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 140 KB

Traversability and connectivity of the m

Traversability and connectivity of the middle graph of a graph

✍ Takashi Hamada; Izumi Yoshimura 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 871 KB

The connectivity index of a weighted gra

The connectivity index of a weighted graph

✍ O. Araujo; J.A. de la Peña 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 435 KB

of length m in G and d, denotes the degre,e of the vertex i. We find upper bounds for "z(G) using the eigenvalues of the Laplaci~.m matrix of an associated weighted graph.