Up a level |

Group by: Item Type | No Grouping

Jump to: Article | Book Section

Number of items: **14**.

Rangarajan, R. and Subramanya, M. S. and Reddy, P. Siva Kota
(2012)
*Neighborhood signed graphs.*
Southeast Asian Bull. Math., 36 (3).
pp. 389-397.

Rangarajan, R. and Reddy, P. Siva Kota and Soner, N. D.
(2012)
*m\rm th power symmetric n-sigraphs.*
Ital. J. Pure Appl. Math. (29).
pp. 87-92.

Reddy, P. Siva Kota and Sampathkumar, E. and Subramanya, M. S.
(2010)
*Common-edge signed graph of a signed graph.*
J. Indones. Math. Soc., 16 (2).
pp. 105-113.

Rangarajan, R. and Reddy, P. Siva Kota
(2010)
*The Edge C4 Signed Graph of a Signed Graph.*
Southeast Asian Bulletin of Mathematics , 34 (6).
pp. 1077-1082.

Rangarajan, R. and Subramanya, M. S. and Reddy, P. Siva Kota
(2010)
*The H-Line Signed Graph of a Signed Graph.*
International Journal of Mathematical Combinatorics, 2.
pp. 37-43.

Sampathkumar, E. and Reddy, P. Siva Kota and Subramanya, M. S.
(2010)
*The line n-sigraph of a symmetric n-sigraph.*
Southeast Asian Bull. Math., 34 (5).
pp. 953-958.
ISSN 0129-2021

Reddy, P. Siva Kota
(2010)
*t-path sigraphs.*
Tamsui Oxf. J. Math. Sci., 26 (4).
pp. 433-441.

Rangarajan, R. and Reddy, P. Siva Kota
(2009)
*Notions of balance and consistency on symmetric n-marked graphs.*
Bull. Pure Appl. Math., 3 (1).
pp. 1-8.

Reddy, P. Siva Kota and Prashanth, B.
(2009)
*Switching equivalence in symmetric n-sigraphs. I.*
Adv. Appl. Discrete Math., 4 (1).
pp. 25-32.

Subramanya, M. S. and Reddy, P. Siva Kota
(2009)
*Triangular line signed graph of a signed graph.*
Adv. Appl. Discrete Math., 4 (1).
pp. 17-23.

Sampathkumar, E. and Reddy, P. Siva Kota and Subramanya, M. S.
(2008)
*(3,d)-sigraph and its applications.*
Adv. Stud. Contemp. Math. (Kyungshang), 17 (1).
pp. 57-67.

Sampathkumar, E. and Reddy, P. Siva Kota and Subramanya, M. S.
(2008)
*Jump symmetric n-sigraph.*
Proc. Jangjeon Math. Soc., 11 (1).
pp. 89-95.

Reddy, P. Siva Kota and Subramanya, M. S.
(2007)
*A characterization of symmetric 3-sigraphs whose line symmetric 3-sigraphs are switching equivalent.*
J. Appl. Math. Anal. Appl., 3 (1).
pp. 23-31.

Sampathkumar, E. and Reddy, P. Siva Kota and Subramanya, M. S.
(2010)
*Directionally n-signed graphs.*
In:
Advances in discrete mathematics and applications: Mysore, 2008.
Ramanujan Math. Soc. Lect. Notes Ser., 13
.
Ramanujan Math. Soc., Mysore, pp. 153-160.