Ayushi Dhama
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Ayushi Dhama has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Deepa Sinha
South Asian University, New Delhi 110068, India
5 shared publications - Obaidullah Wardak
Mathematics, South Asian University, New Delhi, India
2 shared publications
Latest Publications
- Open Access
- 25 September 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (19) , 3492
On Some Properties of Addition Signed Cayley GraphWe define an addition signed Cayley graph on a unitary addition Cayley graph represented by , and study several properties such as balancing, clusterability and sign compatibility of the addition signed Cayley graph . We also study the characterization of canonical consistency of , for some n.- 25 September 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (19) , 3492
Open AccessOn Some Properties of Addition Signed Cayley GraphWe define an addition signed Cayley graph on a unitary addition Cayley graph represented by , and study several properties such as balancing, clusterability and sign compatibility of the addition signed Cayley graph . We also study the characterization of canonical consistency of , for some n. - Open Access
- 27 July 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (15) , 2633
On Some Properties of Signed Cayley Graph Sn
We define the signed Cayley graph on Cayley graph denoted by , and study several properties such as balancing, clusterability and sign-compatibility of the signed Cayley graph . Apart from it we also study the characterization of the canonical consistency of , for some n.- 27 July 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (15) , 2633
Open AccessOn Some Properties of Signed Cayley Graph Sn
We define the signed Cayley graph on Cayley graph denoted by , and study several properties such as balancing, clusterability and sign-compatibility of the signed Cayley graph . Apart from it we also study the characterization of the canonical consistency of , for some n. - 1 December 2017
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 63, 425-434
Unitary Cayley Meet Signed Graphs
- 1 December 2017
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 63, 425-434
Unitary Cayley Meet Signed Graphs
- Open Access
- 1 January 2014
- Published by The Institute for Research and Community Services (LPPM) ITB in Electronic Journal of Graph Theory and Applications
- Vol. 2 (1) , 32-41
Negation switching invariant signed graphs
A signed graph (or, $sigraph$ in short) is a graph G in which each edge x carries a value $\sigma(x) \in \{-, +\}$ called its sign. Given a sigraph S, the negation $\eta(S)$ of the sigraph S is a sigraph obtained from S by reversing the sign of every edge of S. Two sigraphs $S_{1}$ and $S_{2}$ on the same underlying graph are switching equivalent if it is possible to assign signs `+' (`plus') or `-' (`minus') to vertices of $S_{1}$ such that by reversing the sign of each of its edges that has received opposite signs at its ends, one obtains $S_{2}$. In this paper, we characterize sigraphs which are negation switching invariant and also see for what sigraphs, S and $\eta (S)$ are signed isomorphic.- 1 January 2014
- Published by The Institute for Research and Community Services (LPPM) ITB in Electronic Journal of Graph Theory and Applications
- Vol. 2 (1) , 32-41
Open AccessNegation switching invariant signed graphs
A signed graph (or, $sigraph$ in short) is a graph G in which each edge x carries a value $\sigma(x) \in \{-, +\}$ called its sign. Given a sigraph S, the negation $\eta(S)$ of the sigraph S is a sigraph obtained from S by reversing the sign of every edge of S. Two sigraphs $S_{1}$ and $S_{2}$ on the same underlying graph are switching equivalent if it is possible to assign signs `+' (`plus') or `-' (`minus') to vertices of $S_{1}$ such that by reversing the sign of each of its edges that has received opposite signs at its ends, one obtains $S_{2}$. In this paper, we characterize sigraphs which are negation switching invariant and also see for what sigraphs, S and $\eta (S)$ are signed isomorphic. - Open Access
- 2 July 2012
- Published by Christ University Bangalore in Mapana Journal of Sciences
- Vol. 11 (4) , 1-14
Sign-Compatibility of Some Derived Signed Graphs
A signed graph (or sigraph in short) is an ordered pair S = (Su, σ), where Su is a graph G = (V, E), called the underlying graph of S and σ : E → {+1, −1} is a function from the edge set E of Su into the set {+1, −1}, called the signature of S. A sigraph S is sign-compatible if there exists a marking µ of its vertices such that the end vertices of every negative edge receive ‘−1’ marks in µ and no positive edge does so. In this paper, we characterize S such that its ×-line sigraphs, semi-total line sigraphs, semi-total point sigraphs and total sigraphs are sign-compatible.
- 2 July 2012
- Published by Christ University Bangalore in Mapana Journal of Sciences
- Vol. 11 (4) , 1-14
Open AccessSign-Compatibility of Some Derived Signed Graphs
A signed graph (or sigraph in short) is an ordered pair S = (Su, σ), where Su is a graph G = (V, E), called the underlying graph of S and σ : E → {+1, −1} is a function from the edge set E of Su into the set {+1, −1}, called the signature of S. A sigraph S is sign-compatible if there exists a marking µ of its vertices such that the end vertices of every negative edge receive ‘−1’ marks in µ and no positive edge does so. In this paper, we characterize S such that its ×-line sigraphs, semi-total line sigraphs, semi-total point sigraphs and total sigraphs are sign-compatible.