Maximum incomplete recursive circulants in graph embeddings

DOI10.1142/S1793830915500536MaRDI QIDQ2788730zbMATH OpenOpenAlexFDO

Authors R. Sundara Rajan, Paul Manuel, Mirka Miller, T. M. Rajalaxmi, Indra Rajasingh

Publication date 22 February 2016

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s1793830915500536

zbMATH Keywords

congestionembeddingrecursive circulantwire length

Mathematics Subject Classification ID

Distance in graphs (05C12) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Maximum induced subgraph of a recursive circulant
• Recursive circulants and their embeddings among hypercubes
• Panconnectivity and edge-pancyclicity of faulty recursive circulant \(G(2^m,4)\)
• Embedding trees in recursive circulants
• Embeddings of circulant networks

Cites work

• A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
• An edge-isoperimetric problem for powers of the Petersen graph
• Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength
• Embedding ladders and caterpillars into the hypercube
• Embedding of cycles and wheels into arbitrary trees
• Embedding of hypercubes into necklace, windmill and snake graphs
• Embedding of special classes of circulant networks, hypercubes and generalized Petersen graphs
• Embeddings of circulant networks
• Exact wirelength of hypercubes on a grid
• Graph minimum linear arrangement by multilevel weighted edge contractions
• Hamiltonian decomposition of recursive circulant graphs
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2010366 (Why is no real title available?)
• scientific article; zbMATH DE number 2060183 (Why is no real title available?)
• Implementation and Analysis of Binomial Queue Algorithms
• Introduction to algorithms
• Minimum average congestion of enhanced and augmented hypercubes into complete binary trees
• Minimum linear arrangement of chord graphs
• Optimal linear arrangements using betweenness variables
• Path embedding in star graphs
• Recursive circulants and their embeddings among hypercubes
• Some simplified NP-complete graph problems
• The congestion of \(n\)-cube layout on a rectangular grid
• The cyclic cutwidth of trees
• The super-connected property of recursive circulant graphs
• Wirelength of \(1\)-fault Hamiltonian graphs into wheels and fans
• Wirelength of hypercubes into certain trees

Cited in

(2)

• Maximum induced subgraph of a recursive circulant
• scientific article; zbMATH DE number 5521183 (Why is no real title available?)

This page was built for publication: Maximum incomplete recursive circulants in graph embeddings

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