Extremizing first eigenvalue of 3-colored digraphs made with given blocks

DOI10.1016/j.laa.2016.03.045zbMath1338.05162OpenAlexW2324117546MaRDI QIDQ277134

Debajit Kalita

Publication date: 4 May 2016

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2016.03.045

zbMATH Keywords

first eigenvalueLaplacian matrix3-colored digraphfirst eigenvectorweighted directed graph

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items (1)

Complex adjacency spectra of digraphs

Cites Work

• Unnamed Item
• Spectral properties of complex unit gain graphs
• On weighted directed graphs
• Signless Laplacians of finite graphs
• First eigenvalue and first eigenvectors of a nonsingular unicyclic mixed graph
• Minimizing algebraic connectivity over connected graphs with fixed girth
• The least eigenvalues of the signless Laplacian of non-bipartite graphs with pendant vertices
• First eigenvalue of nonsingular mixed graphs with given number of pendant vertices
• The least eigenvalue of signless Laplacian of graphs under perturbation
• On algebraic connectivity of graphs with at most two points of articulation in each block
• On the spectrum of 3-coloured digraphs
• On colored digraphs with exactly one nonsingular cycle
• Properties of first eigenvectors and eigenvalues of nonsingular weighted directed graphs
• On eigenvectors of mixed graphs with exactly one nonsingular cycle
• Matrix Analysis
• Generalized matrix tree theorem for mixed graphs
• Extremizing algebraic connectivity subject to graph theoretic constraints

This page was built for publication: Extremizing first eigenvalue of 3-colored digraphs made with given blocks