A degree sequence problem related to network design

DOI10.1002/NET.3230240402MaRDI QIDQ4303623zbMATH OpenOpenAlexFDO

Authors Daniel Bienstock, Oktay Günlük

Publication date 29 August 1994

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230240402

zbMATH Keywords

design of a target graphintermediate connection networkslightwave networksminimum number of intermediate graphs

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Integer programming (90C10) Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90)

Recommendations

• Algebraic operations on graphs preserving the degree sequence
• scientific article; zbMATH DE number 1862257
• Switching Distance Between Graphs with the Same Degrees
• Networks communicating for each pairing of terminals

Cited in

(7)

• Algebraic operations on graphs preserving the degree sequence
• Making multigraphs simple by a sequence of double edge swaps
• Configuring random graph models with fixed degree sequences
• Weighted Minimum-Length Rearrangement Scenarios.
• Influence of assortativity and degree-preserving rewiring on the spectra of networks
• Sorting genomes by prefix double-cut-and-joins
• A family of switch equivalent graphs

This page was built for publication: A degree sequence problem related to network design

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