✦ LIBER ✦

Some Defective Parameters in Graphs

✍ Scribed by T. Ekim, J. Gimbel

Book ID: 120788664
Publisher: Springer Japan
Year: 2011
Tongue: English
Weight: 197 KB
Volume: 29
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-011-1111-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Some results on graph parameters in weig

Some results on graph parameters in weighted graphs

✍ Peter Dankelmann; Dieter Rautenbach; Lutz Volkmann 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 295 KB

Some parameters of graph and its complem

Some parameters of graph and its complement

✍ Shao-ji Xu 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 627 KB

In this paper, we have discussed the Nordhaus-Gaddum problems for diameter d, girth g, circumference c and edge covering number ill-We have both got the following results. If both G and G are connected, then 4<~d+a~~ 6, then p+2<.c+~<.2p, 3(p-1)<~c.~<.p 2. If both G and G have no isolated vertex, th

On Parameters of Some Graphs from Finite

On Parameters of Some Graphs from Finite Fields

✍ I.E. Shparlinski 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 79 KB

We generalize the construction of F. R. Chung of graphs from finite fields and estimate their parameters with the help of a new bound of exponential sums due to G. I. Perel'muter and the author.

On vertex partitions and some minor-mono

On vertex partitions and some minor-monotone graph parameters

✍ D. Gonçalves 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 107 KB

We study vertex partitions of graphs according to some minormonotone graph parameters. Ding et al. [J Combin Theory Ser B 79(2) (2000), 221-246] proved that some minor-monotone parameters are such that, any graph G with (G) ≥ 2 admits a vertex partition into two graphs with parameter at most (G)-1.

Restricted domination parameters in grap

Restricted domination parameters in graphs

✍ Wayne Goddard; Michael A. Henning 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 249 KB

A note on defective colorings of graphs

A note on defective colorings of graphs in surfaces

✍ Dan Archdeacon 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 139 KB 👁 2 views

A graph is (rn, k)-colorable if its vertices can be colored with rn colors in such a way that each vertex is adjacent to at most k vertices of the same color as itself. In a recent paper Cowen. Cowen, and Woodall proved that, for each compact surface S, there exists an integer k = k(S) such that eve