✦ LIBER ✦

Graphs of nonsingular threshold transformations

✍ Scribed by Takao Ueda

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 695 KB
Volume: 128
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)90125-2

No coin nor oath required. For personal study only.

✦ Synopsis

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 support that procedure are also proved. Then, in addition to circular, nonsingular transformations in the author's previous paper, five classes of noncircular, nonsingular threshold transformations are given with their graph structures.

📜 SIMILAR VOLUMES

Circular nonsingular threshold transform

Circular nonsingular threshold transformations

✍ Takao Ueda 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 628 KB

Ueda, T., Circular nonsingular threshold transformations, Discrete Mathematics 105 (1992) 249-258. Circular n-dimensional Boolean transformations are those which commute with an n-cyclic permutation of variables. A minimal Boolean transformation is the one which has the minimum number of coordinates

Transformations of cubic graphs

✍ Yasuyuki Tsukui 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 401 KB

For simple r-regular graph, an edge-reduction and three transformations (S-, X-, and ~-transformations) are defined which preserve the regularity. In the case r = 3, relations between them are discussed and it is proved that for any two connected cubic graphs with the same order one is obtained from

Some properties of 2-threshold graphs

✍ P. L. Hammer; N. V. R. Mahadev; U. N. Peled 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 330 KB

Bipartite Graphs and Inverse Sign Patter

Bipartite Graphs and Inverse Sign Patterns of Strong Sign-Nonsingular Matrices

✍ R.A. Brualdi; K.L. Chavey; B.L. Shader 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 741 KB

The threshold weight of a graph

✍ Chi Wang; A. C. Williams 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 612 KB

## 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

Hamiltonian threshold for strong product

Hamiltonian threshold for strong products of graphs

✍ Daniel Král'; Ladislav Stacho 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 161 KB

## Abstract We prove that the strong product of any at least ${({\rm ln}}\, {2})\Delta+{O}(\sqrt{\Delta})$ non‐trivial connected graphs of maximum degree at most Δ is pancyclic. The obtained result is asymptotically best possible since the strong product of ⌊(ln 2)__D__⌋ stars __K__~1,__D__~ is not