On some inequalities for the skew Laplacian energy of digraphs.

Adiga, C.; Khoshbakht, Z.

Displaying similar documents to “On some inequalities for the skew Laplacian energy of digraphs.”

On sum of powers of the Laplacian and signless Laplacian eigenvalues of graphs.

Akbari, Saieed, Ghorbani, Ebrahim, Koolen, Jacobus H., Oboudi, Mohammad Reza (2010)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

The Laplacian spectrum of some digraphs obtained from the wheel

Li Su, Hong-Hai Li, Liu-Rong Zheng (2012)

Discussiones Mathematicae Graph Theory

Similarity:

The problem of distinguishing, in terms of graph topology, digraphs with real and partially non-real Laplacian spectra is important for applications. Motivated by the question posed in [R. Agaev, P. Chebotarev, Which digraphs with rings structure are essentially cyclic?, Adv. in Appl. Math. 45 (2010), 232-251], in this paper we completely list the Laplacian eigenvalues of some digraphs obtained from the wheel digraph by deleting some arcs.

Comparative study of graph energies

I. Gutman (2012)

Bulletin, Classe des Sciences Mathématiques et Naturelles, Sciences mathématiques

Similarity:

Cutpoints, lobes and the spectra of graphs

Grone, Robert, Merris, Russell (1988)

Portugaliae mathematica

Similarity:

A new like quantity based on “Estrada index”.

Güngör, A.Dilek (2010)

Journal of Inequalities and Applications [electronic only]

Similarity:

Acyclic digraphs and eigenvalues of $(0, 1)$ -matrices.

McKay, Brendan D., Oggier, Frédérique E., Royle, Gordon F., Sloane, N.J.A., Wanless, Ian M., Wilf, Herbert S. (2004)

Journal of Integer Sequences [electronic only]

Similarity:

Some properties of the distance Laplacian eigenvalues of a graph

Mustapha Aouchiche, Pierre Hansen (2014)

Czechoslovak Mathematical Journal

Similarity:

The distance Laplacian of a connected graph $G$ is defined by $ℒ = Diag (Tr) - 𝒟$ , where $𝒟$ is the distance matrix of $G$ , and $Diag (Tr)$ is the diagonal matrix whose main entries are the vertex transmissions in $G$ . The spectrum of $ℒ$ is called the distance Laplacian spectrum of $G$ . In the present paper, we investigate some particular distance Laplacian eigenvalues. Among other results, we show that the complete graph is the unique graph with only two distinct distance Laplacian eigenvalues. We establish some properties...

On the sum of powers of Laplacian eigenvalues of bipartite graphs

Bo Zhou, Aleksandar Ilić (2010)

Czechoslovak Mathematical Journal

Similarity:

For a bipartite graph $G$ and a non-zero real $α$ , we give bounds for the sum of the $α$ th powers of the Laplacian eigenvalues of $G$ using the sum of the squares of degrees, from which lower and upper bounds for the incidence energy, and lower bounds for the Kirchhoff index and the Laplacian Estrada index are deduced.

Some properties of Laplacian eigenvectors.

Gutman, I. (2003)

Bulletin. Classe des Sciences Mathématiques et Naturelles. Sciences Mathématiques

Similarity:

On the second Laplacian spectral moment of a graph

Ying Liu, Yu Qin Sun (2010)

Czechoslovak Mathematical Journal

Similarity:

Kragujevac (M. L. Kragujevac: On the Laplacian energy of a graph, Czech. Math. J. () (2006), 1207–1213) gave the definition of Laplacian energy of a graph $G$ and proved $L E (G) \geq 6 n - 8$ ; equality holds if and only if $G = P_{n}$ . In this paper we consider the relation between the Laplacian energy and the chromatic number of a graph $G$ and give an upper bound for the Laplacian energy on a connected graph.