✦ LIBER ✦

The irregularity cost or sum of a graph

✍ Scribed by Frank Harary; Michael S. Jacobson; Ewa Kubicka; Grzegorz Kubicki; Ortrud R. Oellermann

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 169 KB
Volume: 6
Category: Article
ISSN: 0893-9659
DOI: 10.1016/0893-9659(93)90039-p

No coin nor oath required. For personal study only.

✦ Synopsis

Working simultaneously in two teams [1,2], we have independently discovered essentially the same concept and many common results. As expected, each team used its own notation and terminology but the results are easily transformed between the two systems. We plan to publish our full papers separately, but present the results here.

📜 SIMILAR VOLUMES

The Irregularity Cost of a Graph

✍ F. Harary; O.R. Oellermann 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 627 KB

A Multigraph His irregular if no two of its nodeahavethe samedegree.It hasbeen shownthat a graphis the underlying graphof some irregularMultigraph if and only if it has at most one trivialcomponentand no componentsof order2. We definethe irregularity cost of such a graph G to be the minimumnumberof

On the sum of all distances in a graph o

On the sum of all distances in a graph or digraph

✍ Ján Plesník 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 870 KB

The transmission of a graph or digraph G is the sum of all distances in G. StFict bounds on the transmission are collected and extended for several classes of graphs and digraphs. For example, in the class of 2connected or Z-edge-mnnected graphs of order n, the maximal transmission is realized only

A note on the irregularity of graphs

✍ F.K. Bell 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 517 KB

The irregularity strength and cost of th

The irregularity strength and cost of the union of cliques

✍ Stanislav Jendroľ; Michal Tkáč; Zsolt Tuza 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 333 KB

Assign positive integer weights to the edges of a simple graph with no component isomorphic to Ki or 1£2, in such a way that the graph becomes irregular, i.e., the weight sums at the vertices become pairwise distinct. The minimum of the largest weights assigned over all such irregular assignments on

The spectral radius of irregular graphs

✍ Lingsheng Shi 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 135 KB

Let λ 1 be the largest eigenvalue and λ n the least eigenvalue of the adjacency matrix of a connected graph G of order n. We prove that if G is irregular with diameter D, maximum degree Δ, minimum degree δ and average degree d, then . The inequality improves previous bounds of various authors and

Tight bounds on the chromatic sum of a c

Tight bounds on the chromatic sum of a connected graph

✍ Carsten Thomassen; Paul Erdös; Yousef Alavi; Paresh J. Malde; Allen J. Schwenk 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 236 KB 👁 1 views