Maximum subgraph problem for 3-regular Knödel graphs and its wirelength

DOI10.1007/978-3-031-25211-2_31MaRDI QIDQ6132556

T. M. Rajalaxmi, R. Sundara Rajan, Remi Mariam Reji

Publication date: 17 August 2023

Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

wirelengthlinear arrangementedge congestionmaximum subgraph problemknödel graph

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• Unnamed Item
• New gossips and telephones
• An edge-isoperimetric problem for powers of the Petersen graph
• Wirelength of hypercubes into certain trees
• Minimum linear gossip graphs and maximal linear (?,k)-gossip graphs
• A Linear Time Algorithm for Embedding Christmas Trees into Certain Trees
• A note on minimum linear arrangement for BC graphs
• Optimal Assignments of Numbers to Vertices

This page was built for publication: Maximum subgraph problem for 3-regular Knödel graphs and its wirelength