✦ LIBER ✦

A characterization of graphs with rank 4

✍ Scribed by Gerard J. Chang; Liang-Hao Huang; Hong-Gwa Yeh

Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 270 KB
Volume: 434
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2010.09.040

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On rank of a matrix associated with grap

On rank of a matrix associated with graph

✍ Vladimir Dobrynin 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 255 KB

On rank three graphs with a large eigenv

On rank three graphs with a large eigenvalue

✍ Carl Bumiller 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 337 KB

A characterization ofP4-indifference gra

A characterization ofP4-indifference graphs

✍ Ho�ng, Ch�nh T.; Maffray, Fr�d�ric; Noy, Marc 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 237 KB 👁 1 views

A graph is a P 4 -indifference graph if it admits a linear ordering ≺ on its vertices such that every chordless path with vertices a, b, c, d and edges ab, bc, cd has either a ≺ b ≺ c ≺ d or d ≺ c ≺ b ≺ a. P 4 -indifference graphs generalize indifference graphs and are perfectly orderable. We give a

A recursive characterization of the 4-co

A recursive characterization of the 4-connected graphs

✍ Nicola Martinov 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 244 KB

We present a complete description of the set of 4-connected contraction-critical graphs.

Rank and chromatic number of a graph

✍ Kotlov, Andrei? 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 105 KB 👁 2 views

It was proved (A. Kotlov and L. Lovász, The rank and size of graphs, J. Graph Theory 23 (1996), 185-189) that the number of vertices in a twin-free graph is O(( √ 2) r ) where r is the rank of the adjacency matrix. This bound was shown to be tight. We show that the chromatic number of a graph is o(∆

On the intersection rank of a graph

✍ James A. Wiseman 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 748 KB

Wiseman, J.A., On the intersection rank of a graph, Discrete Mathematics 104 293-305.