Index of imprimitivity of the non-complete extended -sum of digraphs.
Petrić, M.V. (1995)
Matematichki Vesnik
Similarity:
Displaying similar documents to “The Laplacian spectrum of some digraphs obtained from the wheel”
Index of imprimitivity of the non-complete extended -sum of digraphs.
Sharp Upper Bounds on the Signless Laplacian Spectral Radius of Strongly Connected Digraphs
Weige Xi, Ligong Wang (2016)
Discussiones Mathematicae Graph Theory
Similarity:
Let G = (V (G),E(G)) be a simple strongly connected digraph and q(G) be the signless Laplacian spectral radius of G. For any vertex vi ∈ V (G), let d+i denote the outdegree of vi, m+i denote the average 2-outdegree of vi, and N+i denote the set of out-neighbors of vi. In this paper, we prove that: (1) (1) q(G) = d+1 +d+2 , (d+1 ≠ d+2) if and only if G is a star digraph [...] ,where d+1, d+2 are the maximum and the second maximum outdegree, respectively [...] is the digraph on n vertices...
On some inequalities for the skew Laplacian energy of digraphs.
Adiga, C., Khoshbakht, Z. (2009)
JIPAM. Journal of Inequalities in Pure & Applied Mathematics [electronic only]
Similarity:
On Hallian digraphs and their binding number
Mieczysław Borowiecki, Danuta Michalak (1989)
Banach Center Publications
Similarity:
Primitivity of generalized direct product of digraphs.
Petrić, Milenko (1996)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Which directed graphs have a solution?
Mehdi Behzad, Frank Harary (1977)
Mathematica Slovaca
Similarity:
Problems on fully irregular digraphs
Zdzisław Skupień (1999)
Discussiones Mathematicae Graph Theory
Similarity:
Comparing a Cayley digraph with its reverse.
Abas, M. (2000)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
A note on removing a point of a strong digraph
Peter Horák (1983)
Mathematica Slovaca
Similarity:
Limit points of eigenvalues of (di)graphs
Fu Ji Zhang, Zhibo Chen (2006)
Czechoslovak Mathematical Journal
Similarity:
The study on limit points of eigenvalues of undirected graphs was initiated by A. J. Hoffman in 1972. Now we extend the study to digraphs. We prove: 1. Every real number is a limit point of eigenvalues of graphs. Every complex number is a limit point of eigenvalues of digraphs. 2. For a digraph , the set of limit points of eigenvalues of iterated subdivision digraphs of is the unit circle in the complex plane if and only if has a directed cycle. 3. Every limit point of eigenvalues...