The following pages link to R. Sundara Rajan (Q436586):
Displaying 39 items.
- Embedding of hypercubes into necklace, windmill and snake graphs (Q436587) (← links)
- Bothway embedding of circulant network into grid (Q491606) (← links)
- Biochemical and phylogenetic networks. I: Hypertrees and corona products (Q830807) (← links)
- Biochemical and phylogenetic networks. II: \(X\)-trees and phylogenetic trees (Q830808) (← links)
- EOQ model for time dependent demand and exponentially increasing holding cost under permissible delay in payment with complete backlogging (Q1788210) (← links)
- A linear time algorithm for embedding hypercube into cylinder and torus (Q2015139) (← links)
- Wirelength of embedding complete multipartite graphs into certain graphs (Q2181259) (← links)
- Domination parameters in hypertrees and sibling trees (Q2181261) (← links)
- Transmission in H-naphtalenic nanosheet (Q2243271) (← links)
- A note on the locating-total domination in graphs (Q2364093) (← links)
- Embedding of recursive circulants into certain necklace graphs (Q2516514) (← links)
- Maximum incomplete recursive circulants in graph embeddings (Q2788730) (← links)
- Domination Parameters in Hypertrees (Q2795956) (← links)
- Embedding Circulant Networks into Butterfly and Benes Networks (Q2946066) (← links)
- (Q2975332) (← links)
- (Q3134313) (← links)
- (Q3166164) (← links)
- Embeddings Between Hypercubes and Hypertrees (Q3196315) (← links)
- Improved Bound for Dilation of an Embedding onto Circulant Networks (Q3296854) (← links)
- (Q3452038) (← links)
- (Q3452060) (← links)
- A Linear Time Algorithm for Embedding Christmas Trees into Certain Trees (Q4598908) (← links)
- (Q4598974) (← links)
- A note on minimum linear arrangement for BC graphs (Q4634526) (← links)
- Embedding of special classes of circulant networks, hypercubes and generalized Petersen graphs (Q4903481) (← links)
- An asymptotic relation between the wirelength of an embedding and the Wiener index (Q5051446) (← links)
- Embedding complete multi-partite graphs into Cartesian product of paths and cycles (Q5061707) (← links)
- Wiener index via wirelength of an embedding (Q5063254) (← links)
- An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength (Q5084683) (← links)
- (Q5121937) (← links)
- (Q5133165) (← links)
- Embedding Complete Multipartite Graphs into Certain Trees (Q5133195) (← links)
- A Tight Bound for Congestion of an Embedding (Q5174966) (← links)
- (Q5355047) (← links)
- Maximum subgraph problem for 3-regular Knödel graphs and its wirelength (Q6132556) (← links)
- (Q6162190) (← links)
- Embedding Wheel - like Networks (Q6187747) (← links)
- Lower bounds for dilation, wirelength, and edge congestion of embedding graphs into hypercubes (Q6304346) (← links)
- Embedding into Special Classes of Cyclic Graphs and its Applications in VLSI Layout (Q6421513) (← links)