1 citations · 1 across the 2 of their papers we have counts for
3 papers
On Oriented Diameter of -Star Graphs
K. S. Ajish Kumar, Birenjith Sasidharan, K. S. Sudeep
Assignment of one of the two possible directions to every edge of an undirected graph is called an orientation of . The resulting directed graph is denoted by $\overri…
Oriented Diameter of Star Graphs
K. S. Ajish Kumar, Deepak Rajendraprasad, K. S. Sudeep
An {\em orientation} of an undirected graph is an assignment of exactly one direction to each edge of . Converting two-way traffic networks to one-way traffic networks and b…
On chordal and perfect plane near-triangulations
Sameera M Salam, Daphna Chacko, Nandini J Warrier +2
A plane near-triangulation G can be decomposed into a collection of induced subgraphs, described here as the W-components of G, such that G is perfect (respectively, chordal) if an…