✦ LIBER ✦

Computation of minimal rank and path cover number for certain graphs

✍ Scribed by Francesco Barioli; Shaun Fallat; Leslie Hogben

Book ID: 108198751
Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 290 KB
Volume: 392
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2004.06.019

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On computing the minimum 3-path vertex c

On computing the minimum 3-path vertex cover and dissociation number of graphs

✍ František Kardoš; Ján Katrenič; Ingo Schiermeyer 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 314 KB

Maximum nullity of outerplanar graphs an

Maximum nullity of outerplanar graphs and the path cover number

✍ John Sinkovic 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 151 KB

On the difference between the maximum mu

On the difference between the maximum multiplicity and path cover number for tree-like graphs

✍ Francesco Barioli; Shaun Fallat; Leslie Hogben 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 299 KB

Identifying certain types of parts of a

Identifying certain types of parts of a graph and computing their number

✍ N. P. Khomenko; L. D. Golovko 📂 Article 📅 1973 🏛 Springer 🌐 English ⚖ 638 KB

An algorithm for computing the number of

An algorithm for computing the number of the minimal paths in digital images

✍ P.P. Das 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 450 KB

On the number of distinct minimal clique

On the number of distinct minimal clique partitions and clique covers of a line graph

✍ Sean McGuinness; Rolf Rees 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 812 KB

Let G be a line graph. Orlin determined the clique covering and clique partition numbers cc(G) and cp(G). We obtain a constructive proof of Orlin's result and in doing so we are able to completely enumerate the number of distinct minimal clique covers and partitions of G, in terms of easily calculab