Graph-Theoretic Problems and Their New Applications

Buch | Softcover

294 Seiten

2020
MDPI (Verlag)
978-3-03928-798-7 (ISBN)

Keine Verlagsinformationen verfügbar

Artikel merken

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.

Erscheinungsdatum	01.06.2020
Verlagsort	Basel
Sprache	englisch
Maße	170 x 244 mm
Themenwelt	Mathematik / Informatik ► Mathematik ► Angewandte Mathematik
	Naturwissenschaften
	Technik
Schlagworte	adjacent matrix • approximation methods • bipartite matching extendable graph • bipartite neutrosophic graph • Birkhoff diamond • b-metric-like space • b-metric space • 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-Kirchhoff index • degree of a vertex • degree of edge • degree of vertex • directed cycle • Distance • distance between two vertices • domination game • domination number • edge coloring • edge congestion • Edge Wiener • Embedding • enhanced hypercube • evolution algebra • Evolutionary Approach • Evolution theory • 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 • Kempe chain • Kempe-locking • k-extendable • k-rainbow dominating function • k-rainbow domination number • k-trees • line graph • makespan criterion • mitotic cell cycle • mixed graph • Mycielskian graph • N/A • neutrosophic graph • normalized Laplacian • NP-hard • “partitions” of wheel graph • 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
ISBN-10	3-03928-798-2 / 3039287982
ISBN-13	978-3-03928-798-7 / 9783039287987
Zustand	Neuware