On the powers of signed graphs

DOI10.22049/CCO.2021.27083.1193MaRDI QIDQ6101449zbMATH OpenOpenAlexFDO

Authors T. V. Shijin, K. A. Germina, Shahul Hameed K.

Publication date 1 June 2023

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

zbMATH Keywords

distance compatibilitypower of signed graphssigned distancesigned graph

Mathematics Subject Classification ID

Distance in graphs (05C12) Signed and weighted graphs (05C22) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Abstract: A signed graph is an ordered pair $Sigma=(G,sigma),$ where $G=(V,E)$ is the underlying graph of $Sigma$ with a signature function $sigma:Eightarrow1,-1$. In this article, we define $n^{th}$ power of a signed graph and discuss some properties of these powers of signed graphs. As we can define two types of signed graphs as the power of a signed graph, necessary and sufficient conditions are given for an $n^{th}$ power of a signed graph to be unique. Also, we characterize balanced power signed graphs.

Recommendations

• n-th power signed graphs
• The nth power signed graphs. II
• \(m^{\mathrm{th}}\) power symmetric \(n\)-sigraphs
• Which exterior powers are balanced?
• Signature of power graphs

Cites work

• Further results on graph equations for line graphs and n-th power graphs
• On the notion of balance of a signed graph
• Signed distance in signed graphs

Cited in

(2)

• Walk-powers and homomorphism bounds of planar signed graphs
• scientific article; zbMATH DE number 4137822 (Why is no real title available?)

This page was built for publication: On the powers of signed graphs

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