Topological Graph Theory (TGT) is a branch of mathematics
that studies the interplay between graphs and topology. We discuss how
embeddings and extensions affect multiple exports and minimal in minor-closed
two-sum families of graphs—charts with limited treewidth that use recursive
edge replacement fall under this category. We improve upon the TGT prior upper
limit of fourteen established and, showing that any graph eliminating K4 as a
minor and described by Seymour, in particular parallel-series graphs, may be
embedded into L1 was recently discovered with a distortion of at most two, the
upper bound of two is optimum.
Author(s)details:-
Dr. S Kalaiselvi
Department of Mathematics, University College of Engineering – BIT Campus,
Tiruchirappalli, Tamil Nadu, India.
Please See the book
here :- https://doi.org/10.9734/bpi/rumcs/v6/12066F
No comments:
Post a Comment