Back to Search
Start Over
On the powers of signed graphs.
- Source :
- Communications in Combinatorics & Optimization; Winter/Spring2022, Vol. 7 Issue 1, p45-51, 7p
- Publication Year :
- 2022
-
Abstract
- A signed graph is an ordered pair Σ = (G,σ), where G = (V, E) is the underlying graph of Σ with a signature function σ : E → {1, -1}. In this article, we define the n<superscript>th</superscript> 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<superscript>th</superscript> power of a signed graph to be unique. Also, we characterize balanced power signed graphs. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 25382128
- Volume :
- 7
- Issue :
- 1
- Database :
- Complementary Index
- Journal :
- Communications in Combinatorics & Optimization
- Publication Type :
- Academic Journal
- Accession number :
- 154848597
- Full Text :
- https://doi.org/10.22049/cc0.2021.27083.1193