Reprint
Graph-Theoretic Problems and Their New Applications
Edited by
May 2020
294 pages
- ISBN978-3-03928-798-7 (Paperback)
- ISBN978-3-03928-799-4 (PDF)
This book is a reprint of the Special Issue Graph-Theoretic Problems and Their New Applications that was published in
Computer Science & Mathematics
Engineering
Physical Sciences
Public Health & Healthcare
Summary
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.
Format
- Paperback
License
© 2020 by the authors; CC BY-NC-ND license
Keywords
graph coloring; Kempe chain; Kempe-locking; Birkhoff diamond; hypergraph; generalized hypertree; bound; component; adjacent matrix; signless Laplacian; spectral radius; connectivity; interval-valued fuzzy graph; intuitionistic fuzzy graph; interval-valued intuitionistic fuzzy graph; single-valued neutrosophic graph; interval-valued neutrosophic graph; complement; k-rainbow dominating function; k-rainbow domination number; grids; domination number; Cartesian product; directed cycle; DD index; Wiener index; Edge Wiener; degree of a vertex; distance between two vertices; normalized Laplacian; resistance distance; degree-Kirchhoff index; spanning tree; extremal values; PI index; k-trees; distance; Zagreb indices; reformulated Zagreb indices; degree of vertex; degree of edge; embedding; edge congestion; wirelength; enhanced hypercube; subtree; generating function; fan graph; wheel graph; “partitions” of wheel graph; neutrosophic graph; complete neutrosophic graph; bipartite neutrosophic graph; complement neutrosophic graph; road transport network; wireless multihop network and social network; perfect matching; k-extendable; induced matching extendable; bipartite matching extendable graph; evolution theory; evolution algebra; mitotic cell cycle; total-colored graph; inverse degree index; generalized first Zagreb index; sum lordeg index; corona product; join of graphs; line graph; Mycielskian graph; polynomials in graphs; b-metric space; b-metric-like space; general contractive mappings; graphic contraction mappings; approximation methods; chromatic number; combinatorial optimization; complexity analysis; evolutionary approach; genetic algorithm; graph coloring; NP-hard; stochastic convergence; domination game; competition-independence game; mixed graph; vertex coloring; chromatic number; edge coloring; chromatic index; chromatic polynomial; unit-time scheduling; makespan criterion; n/a