Converse to the Parter--Wiener theorem: the case of non-trees

DOI10.1016/J.DISC.2005.04.025zbMATH Open1114.05061OpenAlexW2057096223MaRDI QIDQ856860FDOQ856860

Authors: Charles R. Johnson, António Leal Duarte 

Publication date: 14 December 2006

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2005.04.025

Recommendations

• Convergence of non-bipartite maps via symmetrization of labeled trees
• The Parter--Wiener Theorem: Refinement and Generalization
• A congruence relation for the Wiener index of trees with path factors
• scientific article; zbMATH DE number 2059940
• scientific article; zbMATH DE number 5151990
• A convergence theorem for \(\Lambda\)-trees
• scientific article; zbMATH DE number 4177078
• On Wiener and terminal Wiener indices of trees
• A Counterexample to the Conjecture of Woess on Simple Random Walks on Trees
• Convex tree realizations of partitions

zbMATH Keywords

eigenvalue multiplicitymatrix graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Hermitian, skew-Hermitian, and related matrices (15B57)

Cites Work

• Matrix Analysis
• Title not available (Why is that?)
• The Parter--Wiener Theorem: Refinement and Generalization
• The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
• On the Eigenvalues and Eigenvectors of a Class of Matrices
• Spectral multiplicity and splitting results for a class of qualitative matrices
• What are Schur complements, anyway?
• Almost principal minors of inverse \(M\)-matrices

Cited In (13)

• Exact SDP relaxations of quadratically constrained quadratic programs with forest structures
• Graphs with eigenvalue \(-1\) of multiplicity \(2 \theta (G)+ \rho (G) -1\)
• Pairing theorem of graph eigenvalues: its new proof and a generalization
• Sets of Parter vertices which are Parter sets
• The change in eigenvalue multiplicity associated with perturbation of a diagonal entry
• Nowhere-zero eigenvectors of graphs
• On the minimum semidefinite rank of a simple graph
• The minimum number of eigenvalues of multiplicity one in a diagonalizable matrix, over a field, whose graph is a tree
• The multiplicity of eigenvalues of unicyclic graphs
• Geometric Parter-Wiener, etc. theory
• Lower bounds for minimum semidefinite rank from orthogonal removal and chordal supergraphs
• Hermitian Matrices, Eigenvalue Multiplicities, and Eigenvector Components
• The Parter--Wiener Theorem: Refinement and Generalization

This page was built for publication: Converse to the Parter--Wiener theorem: the case of non-trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q856860)