Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

The present reprint contains twelve papers published in the Special Issue “Advances in Discrete Applied Mathematics and Graph Theory, 2021” of the MDPI Mathematics journal, which cover a wide range of topics connected to the theory and applications of Graph Theory and Discrete Applied Mathematics. The focus of the majority of papers is on recent advances in graph theory and applications in chemical graph theory. In particular, the topics studied include bipartite and multipartite Ramsey numbers, graph coloring and chromatic numbers, several varieties of domination (Double Roman, Quasi-Total Roman, Total 3-Roman) and two graph indices of interest in chemical graph theory (Sombor index, generalized ABC index), as well as hyperspaces of graphs and local inclusive distance vertex irregular graphs.

Research & information: general --- Mathematics & science --- dominating set --- total roman {3}-domination --- NP-complete --- linear-time algorithm --- Ramsey numbers --- multipartite Ramsey numbers --- stripes --- paths --- cycle --- ABC index --- generalizedABC index --- general Randić index --- topological indices --- converse Hölder inequality --- local antimagic labeling --- local antimagic chromatic number --- copies of graphs --- hyperspace --- graph --- dendroid --- dendrite --- (inclusive) distance vertex irregular labeling --- local (inclusive) distance vertex irregular labeling --- quasi-total Roman domination --- total Roman domination --- Roman domination --- double Roman domination --- generalized Petersen graph --- discharging method --- graph cover --- double Roman graph --- topological index --- vertex degree --- Sombor index --- cactus --- quasi-unicyclic graph --- bipartite Ramsey numbers --- Zarankiewicz number --- total coloring --- dumbbell maximal planar graphs --- I-dumbbell maximal planar graphs --- dumbbell transformation --- total coloring algorithm --- domination coloring --- domination chromatic number --- split graphs --- generalized Petersen graphs --- corona products --- edge corona products --- dominating set --- total roman {3}-domination --- NP-complete --- linear-time algorithm --- Ramsey numbers --- multipartite Ramsey numbers --- stripes --- paths --- cycle --- ABC index --- generalizedABC index --- general Randić index --- topological indices --- converse Hölder inequality --- local antimagic labeling --- local antimagic chromatic number --- copies of graphs --- hyperspace --- graph --- dendroid --- dendrite --- (inclusive) distance vertex irregular labeling --- local (inclusive) distance vertex irregular labeling --- quasi-total Roman domination --- total Roman domination --- Roman domination --- double Roman domination --- generalized Petersen graph --- discharging method --- graph cover --- double Roman graph --- topological index --- vertex degree --- Sombor index --- cactus --- quasi-unicyclic graph --- bipartite Ramsey numbers --- Zarankiewicz number --- total coloring --- dumbbell maximal planar graphs --- I-dumbbell maximal planar graphs --- dumbbell transformation --- total coloring algorithm --- domination coloring --- domination chromatic number --- split graphs --- generalized Petersen graphs --- corona products --- edge corona products

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

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.

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 --- "partitions" of wheel graph