✦ LIBER ✦

On the compatibility between a graph and a simple order

✍ Scribed by Fred S Roberts

Publisher: Elsevier Science
Year: 1971
Tongue: English
Weight: 591 KB
Volume: 11
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(71)90010-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on graphs and sphere orders

✍ Edward R. Scheinerman 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 304 KB

## Abstract A partially ordered set __P__ is called a __k‐sphere order__ if one can assign to each element a ∈ __P__ a ball __B__~__a__~ in __R^k^__ so that __a__ < __b__ iff __B__~__a__~ ⊂ __B__~__b__~. To a graph __G__ = (__V,E__) associate a poset __P__(__G__) whose elements are the vertices and

On the higher-order edge toughness of a

On the higher-order edge toughness of a graph

✍ C.C. Chen; K.M. Koh; Y.H. Peng 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 571 KB

Chen CC., K.M. Koh and Y.H. Peng, On the higher-order edge toughness of a graph, Discrete Mathematics 111 (1993) 113-123. For an integer c, 1 <c < 1 V(G) I-1, we define the cth-order edye toughness of a graph G as The objective of this paper is to study this generalized concept of edge toughness.

On the distribution of eigenvalues of a

On the distribution of eigenvalues of a simple undirected graph

✍ Xuerong Yong 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 86 KB

For a simple, undirected graph q n , let k i q n be the ith largest eigenvalue of q n . This paper presents mainly the following: 1. For n P 4, if q n is incomplete, then 2. Seven sucient and necessary conditions such that k 2 q n À1. 3. k 3 q n À1 implies that k j q n À1Y j 3Y 4Y F F F Y n À 1.

The Order Upper Bound on Parity Embeddin

The Order Upper Bound on Parity Embedding of a Graph

✍ Thomas Zaslavsky 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 398 KB

A graph 1 is parity embedded in a surface if a closed path in the graph is orientation preserving or reversing according to whether its length is even or odd. The parity demigenus of 1 is the minimum of 2&/(S) (where / is the Euler characteristic) over all surfaces S in which 1 can be parity embedde

On a connection between the existence of

On a connection between the existence ofk-trees and the toughness of a graph

✍ Sein Win 📂 Article 📅 1989 🏛 Springer Japan 🌐 English ⚖ 312 KB

Local expansions on graphs and order of

Local expansions on graphs and order of a point

✍ J. J. Charatonik; S. Miklos 📂 Article 📅 1986 🏛 Akadmiai Kiad 🌐 English ⚖ 688 KB