|
|
|
|
| LEADER |
05009nma a2201417 u 4500 |
| 001 |
EB001974504 |
| 003 |
EBX01000000000000001137406 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
210512 ||| eng |
| 020 |
|
|
|a books978-3-03928-799-4
|
| 020 |
|
|
|a 9783039287994
|
| 020 |
|
|
|a 9783039287987
|
| 100 |
1 |
|
|a Werner, Frank
|
| 245 |
0 |
0 |
|a Graph-Theoretic Problems and Their New Applications
|h Elektronische Ressource
|
| 260 |
|
|
|b MDPI - Multidisciplinary Digital Publishing Institute
|c 2020
|
| 300 |
|
|
|a 1 electronic resource (294 p.)
|
| 653 |
|
|
|a edge congestion
|
| 653 |
|
|
|a extremal values
|
| 653 |
|
|
|a domination game
|
| 653 |
|
|
|a road transport network
|
| 653 |
|
|
|a spectral radius
|
| 653 |
|
|
|a evolutionary approach
|
| 653 |
|
|
|a edge coloring
|
| 653 |
|
|
|a directed cycle
|
| 653 |
|
|
|a general contractive mappings
|
| 653 |
|
|
|a genetic algorithm
|
| 653 |
|
|
|a adjacent matrix
|
| 653 |
|
|
|a PI index
|
| 653 |
|
|
|a resistance distance
|
| 653 |
|
|
|a wireless multihop network and social network
|
| 653 |
|
|
|a n/a
|
| 653 |
|
|
|a interval-valued fuzzy graph
|
| 653 |
|
|
|a NP-hard
|
| 653 |
|
|
|a connectivity
|
| 653 |
|
|
|a graphic contraction mappings
|
| 653 |
|
|
|a join of graphs
|
| 653 |
|
|
|a combinatorial optimization
|
| 653 |
|
|
|a approximation methods
|
| 653 |
|
|
|a hypergraph
|
| 653 |
|
|
|a generalized hypertree
|
| 653 |
|
|
|a graph coloring
|
| 653 |
|
|
|a Edge Wiener
|
| 653 |
|
|
|a signless Laplacian
|
| 653 |
|
|
|a k-extendable
|
| 653 |
|
|
|a b-metric space
|
| 653 |
|
|
|a intuitionistic fuzzy graph
|
| 653 |
|
|
|a complexity analysis
|
| 653 |
|
|
|a subtree
|
| 653 |
|
|
|a evolution algebra
|
| 653 |
|
|
|a Birkhoff diamond
|
| 653 |
|
|
|a grids
|
| 653 |
|
|
|a Kempe-locking
|
| 653 |
|
|
|a chromatic number
|
| 653 |
|
|
|a k-trees
|
| 653 |
|
|
|a complement
|
| 653 |
|
|
|a bipartite neutrosophic graph
|
| 653 |
|
|
|a degree of a vertex
|
| 653 |
|
|
|a chromatic polynomial
|
| 653 |
|
|
|a line graph
|
| 653 |
|
|
|a evolution theory
|
| 653 |
|
|
|a corona product
|
| 653 |
|
|
|a stochastic convergence
|
| 653 |
|
|
|a degree of edge
|
| 653 |
|
|
|a k-rainbow dominating function
|
| 653 |
|
|
|a mixed graph
|
| 653 |
|
|
|a b-metric-like space
|
| 653 |
|
|
|a distance between two vertices
|
| 653 |
|
|
|a bipartite matching extendable graph
|
| 653 |
|
|
|a k-rainbow domination number
|
| 653 |
|
|
|a perfect matching
|
| 653 |
|
|
|a neutrosophic graph
|
| 653 |
|
|
|a Kempe chain
|
| 653 |
|
|
|a vertex coloring
|
| 653 |
|
|
|a enhanced hypercube
|
| 653 |
|
|
|a bound
|
| 653 |
|
|
|a Mycielskian graph
|
| 653 |
|
|
|a wheel graph
|
| 653 |
|
|
|a spanning tree
|
| 653 |
|
|
|a sum lordeg index
|
| 653 |
|
|
|a degree of vertex
|
| 653 |
|
|
|a embedding
|
| 653 |
|
|
|a domination number
|
| 653 |
|
|
|a chromatic index
|
| 653 |
|
|
|a competition-independence game
|
| 653 |
|
|
|a unit-time scheduling
|
| 653 |
|
|
|a Cartesian product
|
| 653 |
|
|
|a induced matching extendable
|
| 653 |
|
|
|a polynomials in graphs
|
| 653 |
|
|
|a DD index
|
| 653 |
|
|
|a “partitions” of wheel graph
|
| 653 |
|
|
|a mitotic cell cycle
|
| 653 |
|
|
|a single-valued neutrosophic graph
|
| 653 |
|
|
|a interval-valued intuitionistic fuzzy graph
|
| 653 |
|
|
|a degree-Kirchhoff index
|
| 653 |
|
|
|a Zagreb indices
|
| 653 |
|
|
|a complete neutrosophic graph
|
| 653 |
|
|
|a distance
|
| 653 |
|
|
|a fan graph
|
| 653 |
|
|
|a generating function
|
| 653 |
|
|
|a normalized Laplacian
|
| 653 |
|
|
|a generalized first Zagreb index
|
| 653 |
|
|
|a makespan criterion
|
| 653 |
|
|
|a Wiener index
|
| 653 |
|
|
|a inverse degree index
|
| 653 |
|
|
|a total-colored graph
|
| 653 |
|
|
|a wirelength
|
| 653 |
|
|
|a reformulated Zagreb indices
|
| 653 |
|
|
|a component
|
| 653 |
|
|
|a complement neutrosophic graph
|
| 653 |
|
|
|a interval-valued neutrosophic graph
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b DOAB
|a Directory of Open Access Books
|
| 500 |
|
|
|a Creative Commons (cc), https://creativecommons.org/licenses/by-nc-nd/4.0/
|
| 024 |
8 |
|
|a 10.3390/books978-3-03928-799-4
|
| 856 |
|
|
|u https://directory.doabooks.org/handle/20.500.12854/48854
|3 Volltext
|
| 082 |
0 |
|
|a 576
|
| 082 |
0 |
|
|a 380
|
| 082 |
0 |
|
|a 700
|
| 520 |
|
|
|a 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.
|