𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Highly irregular digraphs

✍ Scribed by Yousef Alavi; Jiuqiang Liu; Jianfang Wang

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
406 KB
Volume
111
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

A connected digraph D is highly irregular if the vertices of out-neighborhood of each vertex UE V(D) have different out-degrees. In this paper, we investigate some problems concerning the existence of highly irregular digraphs with special properties, with particular focus on highly irregular directed trees as well as their independence numbers.

πŸ“œ SIMILAR VOLUMES

Highly irregular graphs
Highly irregular graphs
✍ Yousef Alavi; Gary Chartrand; F. R. K. Chung; Paul ErdΓΆs; R. L. Graham; Ortrud R πŸ“‚ Article πŸ“… 1987 πŸ› John Wiley and Sons 🌐 English βš– 531 KB

A connected graph is highly irregular if each of its vertices is adjacent only to vertices with distinct degrees. In this paper w e investigate several problems concerning the existence and enumeration of highly irregular graphs as well as their independence numbers, with particular focus on the cor

Highly irregular m-chromatic graphs
Highly irregular m-chromatic graphs
✍ Yousef Alavi; Fred Buckley; Marc Shamula; Sergio Ruiz πŸ“‚ Article πŸ“… 1988 πŸ› Elsevier Science 🌐 English βš– 620 KB

A graph is highly irregular if it is connected and the neighbors of each vertex have distinct degrees. In this paper, we study existence and extremal problems for highly irregular graphs with a given maximum degree and focus our attention on highly irregular graphs that are m-chromatic for m 3 2.

An Infinite Highly Arc-transitive Digrap
An Infinite Highly Arc-transitive Digraph
✍ David M. Evans πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 231 KB

The main purpose of this note is to construct an infinite , highly arc-transitive digraph with finite out-valency , and with out-spread greater than 1 , which does not have the two-way infinite path Z as a homomorphic image . This answers Question 3 . 8 in the paper [3] of Cameron , Praeger and Worm