The H-join of arbitrary families of graphs -- the universal adjacency spectrum

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Structural characterization of families of graphs (05C75) Graph operations (line graphs, products, etc.) (05C76)

Abstract: The

H

-join of a family of graphs

m a t h c a l G = G_{1}, d o t s, G_{p}

, also called the generalized composition,

H [G_{1}, d o t s, G_{p}]

, where all graphs are undirected, simple and finite, is the graph obtained by replacing each vertex

i

of

H

by

G_{i}

and adding to the edges of all graphs in

m a t h c a l G

the edges of the join

G_{i} v e e G_{j}

, for every edge

i j

of

H

. Some well known graph operations are particular cases of the

H

-join of a family of graphs

m a t h c a l G

as it is the case of the lexicographic product (also called composition) of two graphs

H

and

G

,

H [G]

. During long time the known expressions for the determination of the entire spectrum of the

H

-join in terms of the spectra of its components and an associated matrix were limited to families of regular graphs. In this work, we extend such a determination, as well as the determination of the characteristic polynomial, to families of arbitrary graphs. From the obtained results, the eigenvectors of the adjacency matrix of the

H

-join can also be determined in terms of the adjacency matrices of the components and an associated matrix.

Recommendations

Cites work

Cited in

(7)

This page was built for publication: The \(H\)-join of arbitrary families of graphs -- the universal adjacency spectrum

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