Improved upper bounds for the Laplacian spectral radius of a graph.
Displaying 181 – 200 of 546
Inertia sets for graphs on six or fewer vertices.
Barrett, Wayne, Jepsen, Camille, Lang, Robert, Mchenry, Emily, Nelson, Curtis, Owens, Kayla (2010)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Inertially arbitrary nonzero patterns of order 4.
Cavers, Michael S., Vander Meulen, Kevin N. (2007)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Integral Cayley graphs defined by greatest common divisors.
Klotz, Walter, Sander, Torsten (2011)
The Electronic Journal of Combinatorics [electronic only]
Integral Cayley graphs over Abelian groups.
Klotz, Walter, Sander, Torsten (2010)
The Electronic Journal of Combinatorics [electronic only]
Integral Cayley Sum Graphs and Groups
Xuanlong Ma, Kaishun Wang (2016)
Discussiones Mathematicae Graph Theory
For any positive integer k, let Ak denote the set of finite abelian groups G such that for any subgroup H of G all Cayley sum graphs CayS(H, S) are integral if |S| = k. A finite abelian group G is called Cayley sum integral if for any subgroup H of G all Cayley sum graphs on H are integral. In this paper, the classes A2 and A3 are classified. As an application, we determine all finite Cayley sum integral groups.
Integral quartic Cayley graphs on Abelian groups.
Abdollahi, A., Vatandoost, E. (2011)
The Electronic Journal of Combinatorics [electronic only]
Interlacing for weighted graphs using the normalized Laplacian.
Butler, Steve (2007)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Inverse eigenvalue problem for constructing a kind of acyclic matrices with two eigenpairs
Maryam Babaei Zarch, Seyed Abolfazl Shahzadeh Fazeli, Seyed Mehdi Karbassi (2020)
Applications of Mathematics
We investigate an inverse eigenvalue problem for constructing a special kind of acyclic matrices. The problem involves the reconstruction of the matrices whose graph is an -centipede. This is done by using the st and th eigenpairs of their leading principal submatrices. To solve this problem, the recurrence relations between leading principal submatrices are used.
Irreducible Toeplitz and Hankel matrices.
Förster, K.-H., Nagy, B. (2006)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Isoperimetric numbers and spectral radius of some infinite planar graphs
Bojan Mohar (1992)
Mathematica Slovaca
Isospectral graphs and isospectral surfaces
Robert Brooks (1996/1997)
Séminaire de théorie spectrale et géométrie
Kernels of directed graph Laplacians.
Caughman, J.S., Veerman, J.J.P. (2006)
The Electronic Journal of Combinatorics [electronic only]
Kocay's lemma, Whitney's theorem, and some polynomial invariant reconstruction problems.
Thatte, Bhalchandra D. (2005)
The Electronic Journal of Combinatorics [electronic only]
Landau's and Rado's theorems and partial tournaments.
Brualdi, Richard A., Kiernan, Kathleen (2009)
The Electronic Journal of Combinatorics [electronic only]
Laplacian integral graphs with maximum degree 3.
Kirkland, Steve (2008)
The Electronic Journal of Combinatorics [electronic only]
Laplacian matrix and distance in trees
Damir Vukičević, Ivan Gutman (2004)
Kragujevac Journal of Mathematics
Laplacian of graphs and algebraic connectivity
Miroslav Fiedler (1989)
Banach Center Publications
Largest eigenvalues of the discrete p-Laplacian of trees with degree sequences.
Biyikoglu, Tuerker, Hellmuth, Marc, Leydold, Josef (2009)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Le trou spectral des graphes et leurs propriétés d'expansion
Yves Colin de Verdière (1993/1994)
Séminaire de théorie spectrale et géométrie