On the uniqueness of D-vertex magic constant
- Arumugam, S., Kamatchi, N., Vijayakumar, G. R.
The convexity graph of minimal total dominating functions of a graph
- Arumugam, S., Jerry, Sithara
Some open problems on graph labelings
- Arumugam, S., Bloom, G. S., Miller, Mirka, Ryan, Joe
Algorithmic aspects of dominator colorings in graphs
- Arumugam, S., Raja Chandrasekar, K., Misra, Neeldhara, Philip, Geevarghese, Saurabh, Saket
Co-secure and secure domination in graphs
- Arumugam, S., Ebadi, Karam, Manrique, Martin
Graph access structures with optimal pixel expansion three
- Arumugam, S., Lakshmanan, R., Nagar, Atulya K.
On chromatic transversal domination in graphs
- Arumugam, S., Raja Chandrasekar, K.
On dominator colorings in graphs
- Arumugam, S., Bagga, Jay, Chandrasekar, K. Raja
Degrees and degree sequence of k-edge d-critical graphs
Some open problems on graph labelings
- Arumugam, S., Bača, M, Froncek, D, Ryan, J, Sugeng, KA
On equality in an upper bound for the equivalence domination number
- Arumugam, S., Sundarakannan, M.
Super (a, 3)-edge-antimagic total labelings for union of two stars
The equivalence chain of a graph
- Arumugam, S., Sundarakannan, M.
Super (a, d)-edge antimagic total labelings of friendship graphs
On (k, n)*-visual cryptography scheme
- Arumugam, S., Lakshmanan, R., Nagar, Atulya K.
Equivalence dominating sets in graphs
- Arumugam, S., Sundarakannan, M.
Irredundant and open irredundant colorings of graphs
- Arumugam, S., Chandrasekar, K. Raja, Sudha, S.
Visual cryptography scheme for graphs with vertex covering number two
- Arumugam, S., Lakshmanan, R., Nagar, A.K.
Equality of domination and transversal numbers in hypergraphs
- Arumugam, S., Jose, Bibin K., Bujtás, Csilla, Tuza, Zsolt
On (a, d)-distance antimagic graphs
Are you sure you would like to clear your session, including search history and login status?