𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Distance spectral radius of digraphs with given connectivity

✍ Scribed by Huiqiu Lin; Weihua Yang; Hailiang Zhang; Jinlong Shu

Book ID
113567622
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
293 KB
Volume
312
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Spectral radius of digraphs with given d
Spectral radius of digraphs with given dichromatic number
✍ Huiqiu Lin; Jinlong Shu πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 237 KB

Let D be a digraph with vertex set V (D). A partition of V (D) into k acyclic sets is called a k-coloring of D. The minimum integer k for which there exists a k-coloring of D is the dichromatic number Ο‡(D) of the digraph D. Denote G n,k the set of the digraphs of order n with the dichromatic number

Graphs and digraphs with given girth and
Graphs and digraphs with given girth and connectivity
✍ Jiping Liu; ; Huishan Zhou πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 230 KB

In this paper, we show that for any given two positive integers g and k with g > 3, there exists a graph (digraph) G with girth g and connectivity k. Applying this result, we give a negative answer to the problem proposed by M. Junger, G. Reinelt and W.R Pulleyblank (1985).

On the distance connectivity of graphs a
On the distance connectivity of graphs and digraphs
✍ M.A. Fiol; J. FΓ brega πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 475 KB

Let G=( V, E) be a digraph with diameter D # 1. For a given integer 1 t. The t-distance edge-connectivity of G is defined analogously. This paper studies some results on the distance connectivities of digraphs and bipartite digraphs. These results are given in terms of the parameter I, which can be