✦ LIBER ✦

Random removal of edges from scale free graphs

✍ Scribed by S. Martin; R.D. Carr; J.-L. Faulon

Publisher: Elsevier Science
Year: 2006
Tongue: English
Weight: 175 KB
Volume: 371
Category: Article
ISSN: 0378-4371
DOI: 10.1016/j.physa.2006.04.046

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Extremal graphs domination insensitive t

Extremal graphs domination insensitive to the removal of k edges

✍ Teresa W. Haynes; Robert C. Brigham; Ronald D. Dutton 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 711 KB

On the Number of Edges of Quadrilateral-

On the Number of Edges of Quadrilateral-Free Graphs

✍ Zoltán Füredi 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 247 KB

If a graph has q 2 +q+1 vertices (q>13), e edges and no 4-cycles then e 1 2 q(q+1) 2 . Equality holds for graphs obtained from finite projective planes with polarities. This partly answers a question of Erdo s from the 1930's. 1996 Academic Press, Inc. ## 1. Results Let f (n) denote the maximum n

Separation of graphs into three componen

Separation of graphs into three components by the removal of edges

✍ Donald L. Goldsmith; Bennet Manvel; Vance Faber 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 266 KB

## Abstract Several ways to separate a connected graph into three components by the removal of edges are discussed. Graphical parameters that count the number of edges removed are introduced and the relations between these parameters are given.

Removing edge-node intersections in draw

Removing edge-node intersections in drawings of graphs

✍ Wei Lai; Peter Eades 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 130 KB

Random models of scale-free networks

✍ Xianmin Geng; Qiang Li 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 203 KB

Independent edges in bipartite graphs ob

Independent edges in bipartite graphs obtained from orientations of graphs

✍ J. G. Gimbel; K. B. Reid 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 800 KB

## Abstract Given a digraph __D__ on vertices __v__~1~, __v__~2~, ⃛, __v__~__n__~, we can associate a bipartite graph __B(D)__ on vertices __s__~1~, __s__~2~, ⃛, __s__~__n__~, __t__~1~, __t__~2~, ⃛, __t__~__n__~, where __s__~__i__~__t__~__j__~ is an edge of __B(D)__ if (__v__~__i__~, __v__~__j__~)