We define the signed Cayley graph on Cayley graph X n denoted by S n, and study several
properties such as balancing, clusterability and sign-compatibility of the signed Cayley …

We define an addition signed Cayley graph on a unitary addition Cayley graph G n
represented by Σ n∧, and study several properties such as balancing, clusterability and sign …

A signed graph Σ is a pair Σ=(Σ u, σ) that consists of a graph (Σ u, E) and a sign mapping
called signature σ from E to the sign group {+,−}. In this paper, we discuss the t-path product …

Abstract Information security and confidentiality are burning issues in today's digitally
connected world. Encryption is considered a fast-moving trend in this reference. Although …

A signed graph (or sigraph in short) is an ordered pair S=(Su,), where Su is a graph G=(V, E)
and: E!{+, âˆ'} is a function from the edge set E of Su into the set {+, âˆ'}. For a positive integer …

A signed graph (or sigraph in short) S is a graph G where the edges are weighted either+ 1
or− 1 called the signs of the edges. Considering Zn′, the integers modulo n, where n is a …

A signed network is a network where each edge receives a sign: positive or negative. In this
paper, we report our investigation on 2-path signed network of a given signed network Σ …

A signed graph S is a graph in which every edge receive either '+'or '-'called the signs of the
edges. The unitary Cayley graph X n is a graph with vertex set Z n, the integers modulo n …

Let be a simple graph having vertex set and edge set, where all are distinct prime factors
and is the set of all units of the ring be a signed graph whose underlying graph is and …

A sigraph is a graph G in which each edge x carries a value s (x)∈{− 1,+ 1} called its sign,
denoted specially as S=(G, s). Given a sigraph S, a new sigraph CE (S), called the common …