Applications of E‐graphs in network design | Zendy

Haynes Teresa W. | Zendy; Lawson Linda M. | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

Applications of E‐graphs in network design

Author(s) -

Haynes Teresa W.,

Lawson Linda M.

Publication year - 1993

Publication title -

networks

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.977

H-Index - 64

eISSN - 1097-0037

pISSN - 0028-3045

DOI - 10.1002/net.3230230504

Subject(s) - indifference graph , computer science , pathwidth , chordal graph , graph product , combinatorics , network planning and design , graph , modular decomposition , discrete mathematics , 1 planar graph , mathematics , theoretical computer science , line graph , computer network

In this paper, we introduce a construction that produces graphs, called E ‐graphs, by replacing the edges in a core graph with a copy of a given graph. These graphs are generalizations of several graphs that have recently been presented as models for network designs, including the G ‐network and its extensions. We discuss several invariant properties of these graphs with emphasis on those of interest in network design, such as number of edges, diameter, and domination number. © 1993 by John Wiley & Sons, Inc.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research