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