Graph-Theoretic Problems and Their New Applications
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-th...
Guardat en:
| Autor principal: | |
|---|---|
| Format: | Online |
| Idioma: | anglès |
| Publicat: |
MDPI - Multidisciplinary Digital Publishing Institute
2021
|
| Matèries: | |
| Accés en línia: | 46117 |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|
| _version_ | 1869528216271585280 |
|---|---|
| author | Werner, Frank |
| author_browse | Werner, Frank |
| author_facet | Werner, Frank |
| author_sort | Werner, Frank |
| collection | Directory of Open Access Books |
| description | 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 | Online |
| id | doab-20.500.12854ir-48854 |
| institution | Directory of Open Access Books |
| language | eng |
| publishDate | 2021 |
| publishDateRange | 2021 |
| publishDateSort | 2021 |
| publisher | MDPI - Multidisciplinary Digital Publishing Institute |
| publisherStr | MDPI - Multidisciplinary Digital Publishing Institute |
| record_format | ojs |
| spelling | doab-20.500.12854ir-488542023-12-20T18:40:39Z Graph-Theoretic Problems and Their New Applications Werner, Frank QA1-939 Q1-390 Zagreb indices n/a generating function mitotic cell cycle Mycielskian graph evolution theory grids “partitions” of wheel graph generalized hypertree connectivity single-valued neutrosophic graph degree of a vertex domination game interval-valued intuitionistic fuzzy graph directed cycle makespan criterion total-colored graph bipartite matching extendable graph stochastic convergence bipartite neutrosophic graph signless Laplacian complete neutrosophic graph k-trees enhanced hypercube b-metric space resistance distance Wiener index mixed graph line graph NP-hard generalized first Zagreb index inverse degree index sum lordeg index Edge Wiener chromatic polynomial degree of vertex complement neutrosophic graph graphic contraction mappings embedding Cartesian product k-rainbow domination number distance between two vertices evolution algebra k-rainbow dominating function PI index subtree component competition-independence game interval-valued fuzzy graph b-metric-like space induced matching extendable edge coloring degree of edge approximation methods chromatic index join of graphs genetic algorithm hypergraph edge congestion complement polynomials in graphs vertex coloring interval-valued neutrosophic graph spanning tree Kempe chain general contractive mappings DD index wireless multihop network and social network distance evolutionary approach complexity analysis neutrosophic graph Kempe-locking wheel graph Birkhoff diamond domination number k-extendable degree-Kirchhoff index adjacent matrix perfect matching spectral radius normalized Laplacian corona product road transport network extremal values bound chromatic number graph coloring combinatorial optimization reformulated Zagreb indices wirelength intuitionistic fuzzy graph unit-time scheduling fan graph bic Book Industry Communication::P Mathematics & science 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. 2021-02-11T14:51:51Z 2021-02-11T14:51:51Z 2020-06-09 16:38:57 2020 book 46117 9783039287987 9783039287994 https://directory.doabooks.org/handle/20.500.12854/48854 eng application/octet-stream Attribution-NonCommercial-NoDerivatives 4.0 International https://mdpi.com/books/pdfview/book/2311 MDPI - Multidisciplinary Digital Publishing Institute 10.3390/books978-3-03928-799-4 10.3390/books978-3-03928-799-4 46cabcaa-dd94-4bfe-87b4-55023c1b36d0 9783039287987 9783039287994 294 open access |
| spellingShingle | QA1-939 Q1-390 Zagreb indices n/a generating function mitotic cell cycle Mycielskian graph evolution theory grids “partitions” of wheel graph generalized hypertree connectivity single-valued neutrosophic graph degree of a vertex domination game interval-valued intuitionistic fuzzy graph directed cycle makespan criterion total-colored graph bipartite matching extendable graph stochastic convergence bipartite neutrosophic graph signless Laplacian complete neutrosophic graph k-trees enhanced hypercube b-metric space resistance distance Wiener index mixed graph line graph NP-hard generalized first Zagreb index inverse degree index sum lordeg index Edge Wiener chromatic polynomial degree of vertex complement neutrosophic graph graphic contraction mappings embedding Cartesian product k-rainbow domination number distance between two vertices evolution algebra k-rainbow dominating function PI index subtree component competition-independence game interval-valued fuzzy graph b-metric-like space induced matching extendable edge coloring degree of edge approximation methods chromatic index join of graphs genetic algorithm hypergraph edge congestion complement polynomials in graphs vertex coloring interval-valued neutrosophic graph spanning tree Kempe chain general contractive mappings DD index wireless multihop network and social network distance evolutionary approach complexity analysis neutrosophic graph Kempe-locking wheel graph Birkhoff diamond domination number k-extendable degree-Kirchhoff index adjacent matrix perfect matching spectral radius normalized Laplacian corona product road transport network extremal values bound chromatic number graph coloring combinatorial optimization reformulated Zagreb indices wirelength intuitionistic fuzzy graph unit-time scheduling fan graph bic Book Industry Communication::P Mathematics & science Werner, Frank Graph-Theoretic Problems and Their New Applications |
| title | Graph-Theoretic Problems and Their New Applications |
| title_full | Graph-Theoretic Problems and Their New Applications |
| title_fullStr | Graph-Theoretic Problems and Their New Applications |
| title_full_unstemmed | Graph-Theoretic Problems and Their New Applications |
| title_short | Graph-Theoretic Problems and Their New Applications |
| title_sort | graph theoretic problems and their new applications |
| topic | QA1-939 Q1-390 Zagreb indices n/a generating function mitotic cell cycle Mycielskian graph evolution theory grids “partitions” of wheel graph generalized hypertree connectivity single-valued neutrosophic graph degree of a vertex domination game interval-valued intuitionistic fuzzy graph directed cycle makespan criterion total-colored graph bipartite matching extendable graph stochastic convergence bipartite neutrosophic graph signless Laplacian complete neutrosophic graph k-trees enhanced hypercube b-metric space resistance distance Wiener index mixed graph line graph NP-hard generalized first Zagreb index inverse degree index sum lordeg index Edge Wiener chromatic polynomial degree of vertex complement neutrosophic graph graphic contraction mappings embedding Cartesian product k-rainbow domination number distance between two vertices evolution algebra k-rainbow dominating function PI index subtree component competition-independence game interval-valued fuzzy graph b-metric-like space induced matching extendable edge coloring degree of edge approximation methods chromatic index join of graphs genetic algorithm hypergraph edge congestion complement polynomials in graphs vertex coloring interval-valued neutrosophic graph spanning tree Kempe chain general contractive mappings DD index wireless multihop network and social network distance evolutionary approach complexity analysis neutrosophic graph Kempe-locking wheel graph Birkhoff diamond domination number k-extendable degree-Kirchhoff index adjacent matrix perfect matching spectral radius normalized Laplacian corona product road transport network extremal values bound chromatic number graph coloring combinatorial optimization reformulated Zagreb indices wirelength intuitionistic fuzzy graph unit-time scheduling fan graph bic Book Industry Communication::P Mathematics & science |
| topic_facet | QA1-939 Q1-390 Zagreb indices n/a generating function mitotic cell cycle Mycielskian graph evolution theory grids “partitions” of wheel graph generalized hypertree connectivity single-valued neutrosophic graph degree of a vertex domination game interval-valued intuitionistic fuzzy graph directed cycle makespan criterion total-colored graph bipartite matching extendable graph stochastic convergence bipartite neutrosophic graph signless Laplacian complete neutrosophic graph k-trees enhanced hypercube b-metric space resistance distance Wiener index mixed graph line graph NP-hard generalized first Zagreb index inverse degree index sum lordeg index Edge Wiener chromatic polynomial degree of vertex complement neutrosophic graph graphic contraction mappings embedding Cartesian product k-rainbow domination number distance between two vertices evolution algebra k-rainbow dominating function PI index subtree component competition-independence game interval-valued fuzzy graph b-metric-like space induced matching extendable edge coloring degree of edge approximation methods chromatic index join of graphs genetic algorithm hypergraph edge congestion complement polynomials in graphs vertex coloring interval-valued neutrosophic graph spanning tree Kempe chain general contractive mappings DD index wireless multihop network and social network distance evolutionary approach complexity analysis neutrosophic graph Kempe-locking wheel graph Birkhoff diamond domination number k-extendable degree-Kirchhoff index adjacent matrix perfect matching spectral radius normalized Laplacian corona product road transport network extremal values bound chromatic number graph coloring combinatorial optimization reformulated Zagreb indices wirelength intuitionistic fuzzy graph unit-time scheduling fan graph bic Book Industry Communication::P Mathematics & science |
| url | 46117 |
| work_keys_str_mv | AT wernerfrank graphtheoreticproblemsandtheirnewapplications |