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

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

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

Publication date: 17 August 2023

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

Recommendations

• scientific article; zbMATH DE number 1833409
• scientific article; zbMATH DE number 930115
• scientific article; zbMATH DE number 1190654
• Maximum regular induced subgraphs in \(2P_3\)-free graphs
• Maximum \(k\)-regular induced subgraphs
• On maximal 3-restricted edge connectivity of regular graphs
• The maximum degree \& diameter-bounded subgraph and its applications
• Approximating the maximum 3-edge-colorable subgraph problem
• The Maximum k-Colorable Subgraph Problem and Related Problems
• The maximum k-colorable subgraph problem for chordal graphs

zbMATH Keywords

wirelengthlinear arrangementedge congestionmaximum subgraph problemknödel graph

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Optimal Assignments of Numbers to Vertices
• An edge-isoperimetric problem for powers of the Petersen graph
• Wirelength of hypercubes into certain trees
• New gossips and telephones
• Minimum linear gossip graphs and maximal linear \((\Delta,k)\)-gossip graphs
• A note on minimum linear arrangement for BC graphs
• A linear time algorithm for embedding Christmas trees into certain trees

Cited In (3)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Embedding of hypercube into fractal cubic network

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6132556)