( en | de | ru )

 

Disambiguation of "Rajasingh, Indra"

Author of the publication

copydeleteadd this publication to your clipboard
Metric dimension of directed graphs.

, , , and . Int. J. Comput. Math., 91 (7): 1397-1406 (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Arsianiwaty Indradjaja

Selvaratnam Indrakumar

Gunawan Indrayanto

Miriam Indra

Nastiti Siswi Indrasti

 

Other publications of authors with the same name

Landmarks in Binary Tree Derived Architectures., , , and . Ars Comb., (2011)On Graphs Whose Acyclic Graphoidal Covering Number Is One Less Than Its Cyclomatic Number., , and . Ars Comb., (2004)Total-Kernel in Oriented Circular Ladder and Mobius Ladder., , , and . Ars Comb., (2016)A note on the locating-total domination in graphs., , , , and . Discuss. Math. Graph Theory, 37 (3): 745-754 (2017)A Linear Time Algorithm for Embedding Christmas Trees into Certain Trees., , and . Parallel Process. Lett., 25 (4): 1550008:1-1550008:17 (2015)APX-hardness and approximation for the k-burning number problem., , , and . Theor. Comput. Sci., (2022)Embedding of hypercubes into sibling trees., , , and . Discret. Appl. Math., (2014)Graphs whose acyclic graphoidal covering number is one less than its maximum degree., , and . Discret. Math., 240 (1-3): 231-237 (2001)Transmission in Butterfly Networks., , , , and . Comput. J., 59 (8): 1174-1179 (2016)A Tight Bound for Congestion of an Embedding., , , , and . CALDAM, volume 8959 of Lecture Notes in Computer Science, page 229-237. Springer, (2015)