An n-tuple (a< sub> 1, a< sub> 2,..., a< sub> n) is symmetric, if a< sub> k= a< sub> n-k+ 1,
1≤ k≤ n. Let Hn={(a< sub> 1, a< sub> 2,..., a< sub> n): a< sub> k∈{+,-}, a< sub> k= a< …

Note on Wing Symmetric n-Sigraphs Page 1 Annals of Pure and Applied Mathematics Vol. 28,
No. 1, 2023, 1-6 ISSN: 2279-087X (P), 2279-0888(online) Published on 20 July 2023 …

(V, E) is a graph called the underlying graph of Sn and σ: E→ Hn (µ: V→ Hn) is a function. In
this paper, we introduced a new notion equitable symmetric n-sigraph of a symmetric n …

An n-tuple (a1, a2,···, an) is symmetric, if ak= an− k+ 1, 1≤ k≤ n. Let Hn={(a1, a2,···, an):
ak∈{+,−}, ak= an− k+ 1, 1≤ k≤ n} be the set of all symmetric n-tuples. A symmetric n …

Unless mentioned or defined otherwise, for all terminology and notion in graph theory the
reader is refer to [1]. We consider only finite, simple graphs free from self-loops. Let n≥ 1 be …

On Equitable Associate Symmetric n-Sigraphs Page 1 International J.Math. Combin. Vol.3(2023),
89-94 On Equitable Associate Symmetric n-Sigraphs KM Manjula (Department of Mathematics …

(Sn=(G, µ)), where G=(V, E) is a graph called the underlying graph of Sn and σ: E→ Hn (µ:
V→ Hn) is a function. In this paper, we introduced a new notion minimal equitable …