On degree product induced signed graphs of graphs
Achu Aniyan, Sudev Naduvath
Abstract
Achu Aniyan, Sudev Naduvath
Abstract
A signed graph is a graph with positive or negative signs assigned to edges. An induced signed graph is a signed graph constructed from a given graph according to some pre-defined protocols. An induced signed graph of a graph G is a signed graph in which each edge uv receives a sign (−1)|φ(v)−φ(u)|, where φ : V(G) → ℤ. In this paper, we discuss degree product induced signed graphs and determine the structural properties of these signed graphs such as balancing, clustering, regularity and co-regularity.
OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A signed graph is a graph with positive or negative signs assigned to edges. An induced signed graph is a signed graph constructed from a given graph according to some pre-defined protocols. An induced signed graph of a graph G is a signed graph in which each edge uv receives a sign (−1)|φ(v)−φ(u)|, where φ : V(G) → ℤ. In this paper, we discuss degree product induced signed graphs and determine the structural properties of these signed graphs such as balancing, clustering, regularity and co-regularity.
Key concepts: Signed graph, Combinatorics, Discrete mathematics, Mathematics, Graph product, Line graph, Symmetric graph, Graph