✦ LIBER ✦

Generalized exponents of primitive directed graphs

✍ Scribed by Richard A. Brualdi; Bolian Liu

Publisher: John Wiley and Sons
Year: 1990
Tongue: English
Weight: 655 KB
Volume: 14
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190140413

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

The exponent of a primitive digraph is the smallest integer t such that for each ordered pair of (not necessarily distinct) vertices x and y there is a path of length t from x to y. There is considerable information known about bounds on exponents and those numbers that can be exponents of primitive digraphs with n vertices. We introduce some new parameters related to the exponent and obtain bounds on these parameters.

📜 SIMILAR VOLUMES

On a conjecture about the generalized ex

On a conjecture about the generalized exponent of primitive matrices

✍ Bolian Liu; Qiaoliang Li 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 122 KB

## Abstract In this paper the conjecture on the __k__th upper multiexponent of primitive matrices proposed by R.A. Brualdi and Liu are completely proved.

Primitivity and independent sets in dire

Primitivity and independent sets in direct products of vertex-transitive graphs

✍ Huajun Zhang 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 92 KB

We introduce the concept of the primitivity of independent set in vertex-transitive graphs, and investigate the relationship between the primitivity and the structure of maximum independent sets in direct products of vertex-transitive graphs. As a consequence of our main results, we positively solve

Index of Primitivity of the Disjunction

Index of Primitivity of the Disjunction and the Composition of Two Directed Graphs

✍ Maria Kwaśnik 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 247 KB

Computer generation of characteristic po

Computer generation of characteristic polynomials of edge-weighted graphs, heterographs, and directed graphs

✍ K. Balasubramanian 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 624 KB

The computer code developed previously (K. Balasubramanian, J . Computational Chern., 5,387 (1984)) for the characteristic polynomials of ordinary (nonweighted) graphs is extended in this investigation to edge-weighted graphs, heterographs (vertex-weighted), graphs with loops, directed graphs, and s

Generalized Pigeonhole Properties of Gra

Generalized Pigeonhole Properties of Graphs and Oriented Graphs

✍ Anthony Bonato; Peter J Cameron; Dejan Delić; Stéphan Thomassé 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 152 KB

A relational structure A satisfies the P(n, k) property if whenever the vertex set of A is partitioned into n nonempty parts, the substructure induced by the union of some k of the parts is isomorphic to A. The P(2, 1) property is just the pigeonhole property, (P), introduced by Cameron, and studied

Semisymmetry of Generalized Folkman Grap

Semisymmetry of Generalized Folkman Graphs

✍ Dragan Marušič; Primož Potočnik 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 221 KB