Explore
Graph-Theoretic Problems and Their New Applications
Frank Werner
2020
0 Ungluers have
Faved this Work
Login to Fave
Graph theory is an important area of applied mathematics with a broad spectrum of applications in many fields. This book results from aSpecialIssue in the journal Mathematics entitled “Graph-Theoretic Problems and Their New Applications”. It contains 20 articles covering a broad spectrum of graph-theoretic works that were selected from 151 submitted papers after a thorough refereeing process. Among others, it includes a deep survey on mixed graphs and their use for solutions ti scheduling problems. Other subjects include topological indices, domination numbers of graphs, domination games, contraction mappings, and neutrosophic graphs. Several applications of graph theory are discussed, e.g., the use of graph theory in the context of molecular processes.
This book is included in DOAB.
Why read this book? Have your say.
You must be logged in to comment.
Rights Information
Are you the author or publisher of this work? If so, you can claim it as yours by registering as an Unglue.it rights holder.Downloads
This work has been downloaded 82 times via unglue.it ebook links.
- 57 - pdf (CC BY-NC-ND) at Unglue.it.
Keywords
- adjacent matrix
- approximation methods
- b-metric space
- b-metric-like space
- bipartite matching extendable graph
- bipartite neutrosophic graph
- Birkhoff diamond
- bound
- Cartesian product
- chromatic index
- chromatic number
- chromatic polynomial
- Combinatorial optimization
- competition-independence game
- complement
- complement neutrosophic graph
- complete neutrosophic graph
- complexity analysis
- component
- connectivity
- corona product
- DD index
- degree of a vertex
- degree of edge
- degree of vertex
- degree-Kirchhoff index
- directed cycle
- distance
- distance between two vertices
- domination game
- domination number
- edge coloring
- edge congestion
- Edge Wiener
- embedding
- enhanced hypercube
- evolution algebra
- evolution theory
- evolutionary approach
- extremal values
- fan graph
- general contractive mappings
- generalized first Zagreb index
- generalized hypertree
- generating function
- genetic algorithm
- graph coloring
- graphic contraction mappings
- grids
- hypergraph
- induced matching extendable
- interval-valued fuzzy graph
- interval-valued intuitionistic fuzzy graph
- interval-valued neutrosophic graph
- intuitionistic fuzzy graph
- inverse degree index
- join of graphs
- k-extendable
- k-rainbow dominating function
- k-rainbow domination number
- k-trees
- Kempe chain
- Kempe-locking
- line graph
- makespan criterion
- mitotic cell cycle
- mixed graph
- Mycielskian graph
- n/a
- neutrosophic graph
- normalized Laplacian
- NP-hard
- perfect matching
- PI index
- polynomials in graphs
- reformulated Zagreb indices
- resistance distance
- road transport network
- signless Laplacian
- single-valued neutrosophic graph
- spanning tree
- spectral radius
- stochastic convergence
- subtree
- sum lordeg index
- total-colored graph
- unit-time scheduling
- vertex coloring
- wheel graph
- Wiener index
- wirelength
- wireless multihop network and social network
- Zagreb indices
- “partitions” of wheel graph
Links
DOI: 10.3390/books978-3-03928-799-4Editions
