The following pages link to T. N. Janakiraman (Q1318836):
Displaying 14 items.
- On special classes of self-centred graphs (Q1318837) (← links)
- New algorithms for multi objective shortest path problem. (Q2477107) (← links)
- (Q2837862) (← links)
- (Q3070292) (← links)
- (Q3140337) (← links)
- (Q3197852) (← links)
- On the Boolean function graph of a graph and on its complement (Q3426072) (← links)
- Domination numbers on the Boolean function graph of a graph (Q3426073) (← links)
- Global domination and neighborhood numbers in Boolean function graph of a graph (Q3426081) (← links)
- Domination numbers on the complement of the Boolean function graph of a graph (Q3426082) (← links)
- (Q4018653) (← links)
- New polynomial time algorithms to compute a set of Pareto optimal paths for multi-objective shortest path problems (Q4653708) (← links)
- GRACEFUL LABELING OF HANGING THETA GRAPHS (Q5166527) (← links)
- (Q5310252) (← links)
