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 …

A signed hypergraph is an ordered triple S=(X, ε, σ), where H=(X, ε) is a hypergraph, called
the underlying hypergraph of S, and σ: ε→{− 1,+ 1} is a function called the signature of S …

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 …

∏ ∏ Page 1 Annals of Pure and Applied Mathematics Vol. 10, No.1, 2015, 21-27 ISSN:
2279-087X (P), 2279-0888(online) Published on 13 April 2015 www.researchmathsci.org 21 …

The anti-Gallai graph Δ (G) of a graph G has the edges of G as its vertices and two distinct
edges of G are adjacent in Δ (G) if they lie on a common triangle in G. Motivated by the …

ON •-LICT SIGNED GRAPHS L•c (S) AND •-LINE SIGNED GRAPHS L•(S) Communicated by
Tommy R. Jensen Page 1 www.combinatorics.ir Transactions on Combinatorics ISSN (print) …

A signed graph (marked graph) is an ordered pair $ S=(G,\sigma) $‎‎ $(S=(G,\mu)) $‎,‎ where $
G=(V, E) $ is a graph called the underlying‎‎ graph of $ S $ and $\sigma: E\rightarrow\{+,-\} $‎‎ …

The line graph of a graph with signed edges carries vertex signs. A vertex-signed graph is
consistent if every circle (cycle, circuit) has positive vertex-sign product. Acharya, Acharya …

A signed graph (or, in short, sigraph) S=(S u, α) consists of an underlying graph S u:= G=(V,
E) and a function a: E (S u)→{+,−}, called the signature of S. The line signed graph of a …

Abstract A signed graph S=(S^ u, σ) S=(S u, σ) consists of an underlying graph S^ u S u and
a function σ: E (S^ u) ⟶ {+,-\} σ: E (S u)⟶+,-. For a graph G, its lict graph written as L_c (G) L c …