✦ LIBER ✦

Jump-number of Means on Graphs

✍ Scribed by Christian Delhommé; Maurice Pouzet; Norbert Sauer

Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 153 KB
Volume: 21
Category: Article
ISSN: 0195-6698
DOI: 10.1006/eujc.2000.0382

No coin nor oath required. For personal study only.

✦ Synopsis

We prove that the jump-number of a symmetric and idempotent n-ary operation defined on the vertex-set of a graph G is at least min g 4 , g-1 n

, where g is the girth of G.

📜 SIMILAR VOLUMES

On graphs whose line graphs have crossin

On graphs whose line graphs have crossing number one

✍ Stanislav Jendrol'; Marián Kles̆c̆ 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 118 KB

## Abstract Necessary and sufficient conditions are given for a nonplanar graph to have a line graph with crossing number one. This corrects some errors in Kulli et al. 4. © 2001 John Wiley & Sons, Inc. J Graph Theory 37: 181–188, 2001

On the chromatic number of disk graphs

✍ Malesi?ska, Ewa; Piskorz, Steffen; Wei�enfels, Gerhard 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 172 KB 👁 2 views

Colorings of disk graphs arise in the study of the frequency-assignment problem in broadcast networks. Motivated by the observations that the chromatic number of graphs modeling real networks hardly exceeds their clique number, we examine the related properties of the unit disk (UD) graphs and their

On the interval number of special graphs

✍ József Balogh; Pascal Ochem; András Pluhár 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 116 KB 👁 1 views

## Abstract The interval number of a graph __G__ is the least natural number __t__ such that __G__ is the intersection graph of sets, each of which is the union of at most __t__ intervals, denoted by __i__(__G__). Griggs and West showed that $i(G)\le \lceil {1\over 2} (d+1)\rceil $. We describe the

Overlap number of graphs

✍ Daniel W. Cranston; Nitish Korula; Timothy D. LeSaulnier; Kevin G. Milans; Chris 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 207 KB

## Abstract An __overlap representation__ of a graph __G__ assigns sets to vertices so that vertices are adjacent if and only if their assigned sets intersect with neither containing the other. The __overlap number__ φ(__G__) (introduced by Rosgen) is the minimum size of the union of the sets in su

On recognizing graphs by numbers of homo

On recognizing graphs by numbers of homomorphisms

✍ Zdeněk Dvořák 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 129 KB

## Abstract Let hom (__G, H__) be the number of homomorphisms from a graph __G__ to a graph __H__. A well‐known result of Lovász states that the function hom (·, __H__) from all graphs uniquely determines the graph __H__ up to isomorphism. We study this function restricted to smaller classes of gra

On the geodetic number of a graph

✍ Gary Chartrand; Frank Harary; Ping Zhang 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 308 KB