Total graph of a signed graph

DOI10.26493/1855-3974.2842.6B5MaRDI QIDQ5056836zbMATH OpenOpenAlexFDO

Authors Francesco Belardo, Zoran Stanić, Thomas Zaslavsky

Publication date 8 December 2022

Published in Ars Mathematica Contemporanea (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1908.02001

zbMATH Keywords

graph eigenvaluesCartesian product graphbidirected graphsigned line graphregular signed graphsigned total graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Signed and weighted graphs (05C22) Graph operations (line graphs, products, etc.) (05C76)

Abstract: The total graph is built by joining the graph to its line graph by means of the incidences. We introduce a similar construction for signed graphs. Under two similar definitions of the line signed graph, we define the corresponding total signed graph and we show that it is stable under switching. We consider balance, the frustration index and frustration number, and the largest eigenvalue. In the regular case we compute the spectrum of the adjacency matrix of the total graph and the spectra of certain compositions, and we determine some with exactly two main eigenvalues.

Recommendations

• Signed total domatic number of a graph
• Line signed graph of a signed total graph
• Signed Total Domination Nnumber of a Graph
• Characterization of total signed graph and semi-total signed graphs
• scientific article; zbMATH DE number 2095760
• Signed total \((k,k)\)-domatic number of a graph
• scientific article; zbMATH DE number 5141364
• Signed total k-domatic numbers of graphs
• Graphoidal signed graphs
• scientific article; zbMATH DE number 6315767

Cites work

• scientific article; zbMATH DE number 740754 (Why is no real title available?)
• scientific article; zbMATH DE number 1953187 (Why is no real title available?)
• scientific article; zbMATH DE number 7157359 (Why is no real title available?)
• Balance and consistency of total signed graphs
• Characterizations of signed graphs
• Lexicographic polynomials of graphs and their spectra
• Main eigenvalues of real symmetric matrices with application to signed graphs
• Matrices in the theory of signed simple graphs
• On equitable partition of matrices and its applications
• On graphs whose least eigenvalue exceeds -1-2
• On graphs whose least eigenvalue is greater than –2
• On products and line graphs of signed graphs, their eigenvalues and energy
• On the Laplacian coefficients of signed graphs
• Orientation of signed graphs
• Signed graph coloring
• Signed graphs
• Spectra of graphs obtained by a generalization of the join graph operation

Cited in

(15)

• Gain total graphs and their spectra via G-phases and group representations
• Spectra of the Mycielskian of a signed graph and related products
• A lexicographic product for signed graphs
• Signed graphs with strong (anti-)reciprocal eigenvalue property
• On the complement of a signed graph
• Net Laplacian eigenvalues of certain corona-like products of signed graphs
• On H-joins of complex unit gain graphs and their stability
• Linear ternary codes of strongly regular signed graphs
• Spectra of total graphs
• Net Laplacian spectrum of some products built on the simple corona of a signed graph
• scientific article; zbMATH DE number 6315767 (Why is no real title available?)
• Estimating distance between an eigenvalue of a signed graph and the spectrum of an induced subgraph
• On eigenspaces of some compound complex unit gain graphs
• On composition of signed graphs
• Recognizing signed line graphs with a single root

This page was built for publication: Total graph of a signed graph

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