Tight frame graphs arising as line graphs

MaRDI QIDQ4987379zbMATH OpenFDO

Authors Veronika Furst, Howard Grotts

Publication date 3 May 2021

Full work available at URL https://arxiv.org/abs/2007.08673, https://journals.calstate.edu/pump/article/view/2415

zbMATH Keywords

dual multiplicity graphGram matrixLaplacian matrixline graphtight frame graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph operations (line graphs, products, etc.) (05C76) Eigenvalues, singular values, and eigenvectors (15A18) General harmonic expansions, frames (42C15)

Abstract: Dual multiplicity graphs are those simple, undirected graphs that have a weighted Hermitian adjacency matrix with only two distinct eigenvalues. From the point of view of frame theory, their characterization can be restated as which graphs have a representation by a tight frame. In this paper, we classify certain line graphs that are tight frame graphs and improve a previous result on the embedding of frame graphs in tight frame graphs.

Recommendations

• Frame graph
• On the construction of equiangular frames from graphs
• Undirected graphs of Hermitian matrices that admit only two distinct eigenvalues
• Finite two-distance tight frames
• Properties of certain multi-angle tight frames in \(\mathbb{R}^d\)

Cites work

• Achievable multiplicity partitions in the inverse eigenvalue problem of a graph
• An introduction to finite tight frames
• Applications of analysis to the determination of the minimum number of distinct eigenvalues of a graph
• Characterizations of derived graphs
• Every Hilbert space frame has a Naimark complement
• Frame graph
• Frames for undergraduates
• scientific article; zbMATH DE number 6125590 (Why is no real title available?)
• scientific article; zbMATH DE number 964896 (Why is no real title available?)
• Introduction to finite frame theory
• Minimum number of distinct eigenvalues of graphs
• On the Line Graph of the Complete Bipartite Graph
• On the Shannon capacity of a graph
• Optimization methods for frame conditioning and application to graph Laplacian scaling
• Positive semidefinite maximum nullity and zero forcing number
• The inverse eigenvalue problem of a graph: multiplicities and minors
• The nowhere-zero eigenbasis problem for a graph
• Undirected graphs of Hermitian matrices that admit only two distinct eigenvalues
• Zero forcing parameters and minimum rank problems
• Zero forcing sets and the minimum rank of graphs

Cited in

(3)

• Lattices, frames and Norton algebras of dual polar graphs
• Frame graph
• Regular graphs of degree at most four that allow two distinct eigenvalues

This page was built for publication: Tight frame graphs arising as line graphs

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