Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Eigenpairs of adjacency matrices of balanced signed graphs
View through CrossRef
Abstract
In this article, we study eigenvalues
λ
\lambda
and their associated eigenvectors
x
x
of the adjacency matrices
A
A
of balanced signed graphs. Balanced signed graphs were first introduced and studied by Harary to handle a problem in social psychology. Harary showed in 1953 that a signed graph is balanced if and only if its vertex set
V
V
can be divided into two sets (either of which may be empty),
X
X
and
Y
Y
, so that each edge between the sets is negative and each within a set is positive. Based on this fundamental theorem for the balanced signed graphs, vertices of a balanced signed graph can be labeled in a way so that its adjacency matrix is well structured. Using this special structure, we find algebraically all eigenvalues and their associated eigenvectors of the adjacency matrix
A
A
of a given balanced signed graph. We present in this study eigenpairs
(
λ
,
x
)
\left(\lambda ,x)
of adjacency matrices of balanced signed graphs with some special structures.
Title: Eigenpairs of adjacency matrices of balanced signed graphs
Description:
Abstract
In this article, we study eigenvalues
λ
\lambda
and their associated eigenvectors
x
x
of the adjacency matrices
A
A
of balanced signed graphs.
Balanced signed graphs were first introduced and studied by Harary to handle a problem in social psychology.
Harary showed in 1953 that a signed graph is balanced if and only if its vertex set
V
V
can be divided into two sets (either of which may be empty),
X
X
and
Y
Y
, so that each edge between the sets is negative and each within a set is positive.
Based on this fundamental theorem for the balanced signed graphs, vertices of a balanced signed graph can be labeled in a way so that its adjacency matrix is well structured.
Using this special structure, we find algebraically all eigenvalues and their associated eigenvectors of the adjacency matrix
A
A
of a given balanced signed graph.
We present in this study eigenpairs
(
λ
,
x
)
\left(\lambda ,x)
of adjacency matrices of balanced signed graphs with some special structures.
Related Results
Funkcije komunikacijski relevantne šutnje u njemačkome
Funkcije komunikacijski relevantne šutnje u njemačkome
Additionally, this chapter presents research of silence with review of main aspects of papers in the field of conversational analysis, ethnography of communication and metaphor of ...
Computing the Energy of Certain Graphs based on Vertex Status
Computing the Energy of Certain Graphs based on Vertex Status
Background:
The concept of Hückel molecular orbital theory is used to compute the graph energy numerically and graphically on the base of the status of a vertex.
Objective:
Our a...
Weakly Modular Graphs and Nonpositive Curvature
Weakly Modular Graphs and Nonpositive Curvature
This article investigates structural, geometrical, and topological characterizations and properties of weakly modular graphs and of cell complexes derived from them. The unifying t...
Independent Set in Neutrosophic Graphs
Independent Set in Neutrosophic Graphs
New setting is introduced to study neutrosophic independent number and independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key term to have th...
Failed Independent Number in Neutrosophic Graphs
Failed Independent Number in Neutrosophic Graphs
New setting is introduced to study neutrosophic failed-independent number and failed independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key t...
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Abstract
Chordal graphs are characterized as the intersection graphs of subtrees in a tree and such a representation is known as the tree model. Restricting the characteriz...
On the reciprocal distance spectrum of edge corona of graphs
On the reciprocal distance spectrum of edge corona of graphs
The reciprocal distance spectrum (Harary spectrum) of a connected graph [Formula: see text] is the multiset of eigenvalues of its reciprocal distance matrix (Harary matrix) [Formul...
Data Analytics on Graphs Part I: Graphs and Spectra on Graphs
Data Analytics on Graphs Part I: Graphs and Spectra on Graphs
The area of Data Analytics on graphs promises a paradigm shift, as we approach information processing of new classes of data which are typically acquired on irregular but structure...