𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the equations of the edge cone of a graph¶and some applications

✍ Scribed by Rafael H. Villarreal

Publisher
Springer
Year
1998
Tongue
English
Weight
99 KB
Volume
97
Category
Article
ISSN
0025-2611

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the edge-integrity of some graphs and
On the edge-integrity of some graphs and their complements
✍ R. Laskar; S. Stuecle; B. Piazza 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 483 KB

In this paper the authors study the edge-integrity of graphs. Edge-integrity is a very useful measure of the vulnerability of a network, in particular a communication network, to disruption through the deletion of edges. A number of problems are examined, including some Nordhaus-Gaddum type results.

On the edge-toughness of a graph. II
On the edge-toughness of a graph. II
✍ Y. H. Peng; T. S. Tay 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 558 KB

## Abstract The edge‐toughness __T__~1~(__G__) of a graph __G__ is defined as equation image where the minimum is taken over every edge‐cutset __X__ that separates __G__ into ω (__G__ ‐ __X__) components. We determine this quantity for some special classes of graphs that also gives the arboricity

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.

The Length of the Shortest Edge of a Gra
The Length of the Shortest Edge of a Graph on a Sphere
✍ Hiroshi Maehara 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 62 KB

Let S d denote a unit sphere in the (d + 1)-dimensional Euclidean space R d+1 (d ≥ 1). For a simple graph G E with edge set E, take independent random points x k , k ∈ V (G E ), on S d , and let D E be the minimum value of the spherical distance between x i , x j for {i, j} ∈ E. We prove that , whe