Core Concepts

Graphs with purely imaginary per-spectrum can be constructed by coalescing a rooted graph and a rooted tree, where the roots satisfy certain conditions.

Abstract

The article discusses the problem of characterizing graphs with purely imaginary per-spectrum, which was posed by Borowiecki and Jóźwiak in 1983. The authors provide a construction method for such graphs using the coalescence of rooted graphs.
Key highlights:
Bipartite graphs containing no subgraph which is an even subdivision of K2,3 have purely imaginary per-spectrum. Such graphs are planar and admit a Pfaffian orientation.
The authors investigate the case where the bipartite graph contains a subgraph which is an even subdivision of K2,3.
They provide a construction method where the coalescence of a rooted graph (G1, r1) and a rooted tree (T, r2) results in a graph with purely imaginary per-spectrum, if the polynomial H(G1, T) has all its roots purely imaginary.
The authors demonstrate the construction for specific cases, such as when G1 is K2,3 rooted at a degree 3 vertex or a degree 2 vertex, and T is a starlike or pathlike tree.
They also provide examples of nonplanar graphs with purely imaginary per-spectrum obtained by coalescing K3,3 with rooted starlike or pathlike trees.
The article concludes by discussing various ways to extend the construction idea, such as using different rooted graphs or different definitions of the rooted product.

Stats

None.

Quotes

None.

Key Insights Distilled From

by Ranveer Sing... at **arxiv.org** 04-18-2024

Deeper Inquiries

Beyond bipartite graphs, other classes of graphs that can be characterized as having purely imaginary per-spectrum include trees and certain subclasses of non-bipartite graphs. For instance, trees with specific properties related to their structure and connectivity can exhibit purely imaginary per-spectrum. Additionally, certain families of graphs, such as theta graphs and cycles, under certain conditions, can also have purely imaginary per-spectrum. These classes of graphs often have distinct structural characteristics that lead to their unique spectral properties, making them identifiable based on their per-spectrum.

The construction method described in the context can indeed be generalized to handle a broader range of rooted graphs and trees. By extending the coalescence technique to different types of rooted graphs and trees, one can explore a wider variety of graph structures that exhibit purely imaginary per-spectrum. This generalization involves considering various combinations of rooted graphs and trees, each with specific properties that contribute to the resulting graph's spectral characteristics. By systematically exploring different combinations and configurations, one can identify new classes of graphs with purely imaginary per-spectrum beyond the examples discussed in the context.

The properties of the per-spectrum and the spectrum play distinct roles in graph characterization and distinguishing power. While the spectrum of a graph provides information about its eigenvalues and structural properties, the per-spectrum offers insights into the roots of the permanental polynomial, which is a combinatorial function associated with the graph. The per-spectrum can capture unique structural features of a graph that may not be evident from its spectrum alone, making it a valuable tool for distinguishing between different graph classes.
In terms of graph characterization, the per-spectrum can be particularly useful for identifying specific graph families or subclasses that exhibit distinct spectral properties. By analyzing the roots of the permanental polynomial, researchers can uncover hidden structural patterns and relationships within graphs that are not easily discernible from traditional spectral analysis. This additional layer of information provided by the per-spectrum enhances the overall graph characterization process and contributes to a more comprehensive understanding of graph structures and properties.

0