✦ LIBER ✦

The orders of graphs with prescribed degree sets

✍ Scribed by Timothy A. Sipka

Publisher: John Wiley and Sons
Year: 1980
Tongue: English
Weight: 321 KB
Volume: 4
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190040308

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

The degree set 𝒟^G^ of a graph G is the set of degrees of the vertices of G. For a finite nonempty set S of positive integers, all positive integers p are determined for which there exists a graph G of order p such that 𝒟^G^ = S.

📜 SIMILAR VOLUMES

Graphs of Prescribed Girth and Bi-Degree

✍ Z. Furedi; F. Lazebnik; A. Seress; V.A. Ustimenko; A.J. Woldar 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 426 KB

Constructing a bipartite graph of maximu

Constructing a bipartite graph of maximum connectivity with prescribed degrees

✍ Asano, Takao 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 328 KB 👁 3 views

d 2,n 2 ) is a bipartite graphical sequence, if there is a bipartite graph G with degrees {D 1 , D 2 } (i.e., G has two independent vertex sets In other words, {D 1 , D 2 } is a bipartite graphical sequence if and only if there is an n 1 1 n 2 matrix of 0's and 1's having d 1j 1 1's in row j 1 and

Realizability of p-point graphs with pre

Realizability of p-point graphs with prescribed minimum degree, maximum degree, and line connectivity

✍ F. T. Boesch; C. L. Suffel 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 316 KB

## Abstract It is well known that certain graph‐theoretic extremal questions play a central role in the study of communication network vulnerability. Herein we consider a generalization of some of the classical results in this area. We define a (__p__, Δ, δ, λ) graph as a graph having __p__ points,

Infinite families of crossing-critical g

Infinite families of crossing-critical graphs with prescribed average degree and crossing number

✍ Drago Bokal 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 242 KB 👁 1 views

## Abstract Širáň constructed infinite families of __k__‐crossing‐critical graphs for every __k__⩾3 and Kochol constructed such families of simple graphs for every __k__⩾2. Richter and Thomassen argued that, for any given __k__⩾1 and __r__⩾6, there are only finitely many simple __k__‐crossing‐criti

Realizability of p-point, q-line graphs

Realizability of p-point, q-line graphs with prescribed maximum degree and line connectivity or minimum degree

✍ D. DiMarco 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 74 KB 👁 3 views

Degree sequences of graphs and dominance

Degree sequences of graphs and dominance order

✍ Triesch, Eberhard 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 271 KB 👁 2 views

Suppose that the graphical partition H(A) = (a: 2 . . . 2 a:) arises from A = (al 2 . . . 2 a,) by deleting the largest summand a1 from A and reducing the a1 largest of the remaining summands by one. Let (a;+l 2 . . 2 ah) = H ( A ) denote the partition obtained by applying the operator H i times. We