๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Existence of graphs with prescribed mean distance

โœ Scribed by G. R. T. Hendry

Publisher
John Wiley and Sons
Year
1986
Tongue
English
Weight
84 KB
Volume
10
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The orders of graphs with prescribed deg
The orders of graphs with prescribed degree sets
โœ Timothy A. Sipka ๐Ÿ“‚ Article ๐Ÿ“… 1980 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 321 KB ๐Ÿ‘ 1 views

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

Circular Chromatic Numbers of Distance G
Circular Chromatic Numbers of Distance Graphs with Distance Sets Missing Multiples
โœ Lingling Huang; Gerard J Chang ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 114 KB

Given positive integers m, k, s with m > sk, let D m,k,s represent the set {1, 2, . . . , m}\{k, 2k, . . . , sk}. The distance graph G(Z , D m,k,s ) has as vertex set all integers Z and edges connecting i and j whenever |i -j| โˆˆ D m,k,s . This paper investigates chromatic numbers and circular chroma

Circular chromatic number of distance gr
Circular chromatic number of distance graphs with distance sets of cardinality 3
โœ Xuding Zhu ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 104 KB

## Abstract Suppose __D__ is a subset of __R__^+^. The distance graph __G__(__R, D__) is the graph with vertex set __R__ in which two vertices __x__,__y__ are adjacent if |__x__โˆ’__y__| โˆˆ __D__. This study investigates the circular chromatic number and the fractional chromatic number of distance gra

Half-transitive graphs of valency 4 with
Half-transitive graphs of valency 4 with prescribed attachment numbers
โœ Maru?i?, Dragan; Waller, Adrian O. ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 134 KB ๐Ÿ‘ 2 views

A graph X is said to be 1 2 -transitive if its automorphism group Aut X acts vertex-and edge-, but not arc-transitively on X. Then Aut X induces an orientation of the edges of X. If X has valency 4, then this orientation gives rise to so-called alternating cycles, that is even length cycles in X who