✦ LIBER ✦

The threshold weight of a graph

✍ Scribed by Chi Wang; A. C. Williams

Publisher: John Wiley and Sons
Year: 1991
Tongue: English
Weight: 612 KB
Volume: 15
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190150302

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

The threshold weight of a graph G is introduced as a measure of the amount by which G differs from being a threshold graph. The threshold graphs are precisely the graphs whose threshold weights are 0. At the opposite extreme is the class of graphs for which the threshold weight is the maximum possible. Such graphs are defined as heavy graphs. Among the results are as following: A theorem that specifies the threshold weight of any triangle‐free graph; necessary and sufficient conditions for a heavy graph in terms of the solvability of a system of linear inequalities; some sufficient conditions for a graph to be heavy and a necessary condition (conjectured to be sufficient, as well) for a heavy graph in terms of its cliques.

📜 SIMILAR VOLUMES

Optimal clustering in graphs with weight

Optimal clustering in graphs with weighted edges: A unified approach to the threshold problem

✍ Goetschel, Roy ;Voxman, William 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 691 KB

## Relations on a finite set V are viewed as weighted graphs. Using the language of graph theory two methods of partitioning V are examined. In one method, partitionings of V are obtained by selecting threshold values and applying them to a maximal weighted spanning forest. In another method a para

Graphs of nonsingular threshold transfor

Graphs of nonsingular threshold transformations

✍ Takao Ueda 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 695 KB

After the graph structures of self-dual nonsingular (i.e. one-to-one) transformations of (0, 1)" are described, a construction method of generating minimal nonsingular threshold transformations from lower-dimensional ones is presented. Theorems which concern nonsingular threshold transformations and

A class of threshold and domishold graph

A class of threshold and domishold graphs: equistable and equidominating graphs

✍ Charles Payan 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 484 KB

A thwahold grerph (rtzspativ4y domlshukf graph) is 01 graph for which the independent 881% (rapsctiwzly ths dominuting a&a) cctn bgr chnfuctsrixsd by the 0, l-aolutiona of a linaur ## kpallty (ass [ij and [S]), We define here the #rugher far which the mawlmal indapsndent eettr (rsopsctivsly tha m

Maximum-weight-window problem of a plana

Maximum-weight-window problem of a planar graph

✍ Kazuaki Yamaguchi; Ken Kotani; Sumio Masuda; Toshinobu Kashiwabara 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 406 KB 👁 1 views

Unprovability threshold for the planar g

Unprovability threshold for the planar graph minor theorem

✍ Andrey Bovykin 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 226 KB

Weight choosability of graphs

✍ Tomasz Bartnicki; Jarosław Grytczuk; Stanisław Niwczyk 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 155 KB

## Abstract Suppose the edges of a graph __G__ are assigned 3‐element lists of real weights. Is it possible to choose a weight for each edge from its list so that the sums of weights around adjacent vertices were different? We prove that the answer is positive for several classes of graphs, includi