Listing 1 - 7 of 7 |
Sort by
|
Choose an application
This book presents a compendium of the 10 articles published in the recent Special Issue “Distance and Domination in Graphs”. The works appearing herein deal with several topics on graph theory that relate to the metric and dominating properties of graphs. The topics of the gathered publications deal with some new open lines of investigations that cover not only graphs, but also digraphs. Different variations in dominating sets or resolving sets are appearing, and a review on some networks’ curvatures is also present.
independent domination --- stable graph --- tree --- unicyclic graph --- graph --- automorphism group --- determining number --- cograph --- unit interval graph --- simultaneous strong resolving set --- simultaneous strong metric dimension --- simultaneous strong resolving graph --- total outer k-independent domination --- total domination --- k-independence --- total Roman domination --- Roman domination --- semitotal domination --- domination --- efficient open domination --- digraphs --- products of digraphs --- secure total domination --- rooted product graph --- Roman domination number --- perfect Roman domination number --- strong resolving graph --- strong metric dimension --- strong resolving set --- cactus graphs --- unicyclic graphs --- network science --- network curvature --- discrete Ricci curvature --- earth-mover’s distance
Choose an application
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
This book presents a compendium of the 10 articles published in the recent Special Issue “Distance and Domination in Graphs”. The works appearing herein deal with several topics on graph theory that relate to the metric and dominating properties of graphs. The topics of the gathered publications deal with some new open lines of investigations that cover not only graphs, but also digraphs. Different variations in dominating sets or resolving sets are appearing, and a review on some networks’ curvatures is also present.
Research & information: general --- Mathematics & science --- independent domination --- stable graph --- tree --- unicyclic graph --- graph --- automorphism group --- determining number --- cograph --- unit interval graph --- simultaneous strong resolving set --- simultaneous strong metric dimension --- simultaneous strong resolving graph --- total outer k-independent domination --- total domination --- k-independence --- total Roman domination --- Roman domination --- semitotal domination --- domination --- efficient open domination --- digraphs --- products of digraphs --- secure total domination --- rooted product graph --- Roman domination number --- perfect Roman domination number --- strong resolving graph --- strong metric dimension --- strong resolving set --- cactus graphs --- unicyclic graphs --- network science --- network curvature --- discrete Ricci curvature --- earth-mover’s distance --- independent domination --- stable graph --- tree --- unicyclic graph --- graph --- automorphism group --- determining number --- cograph --- unit interval graph --- simultaneous strong resolving set --- simultaneous strong metric dimension --- simultaneous strong resolving graph --- total outer k-independent domination --- total domination --- k-independence --- total Roman domination --- Roman domination --- semitotal domination --- domination --- efficient open domination --- digraphs --- products of digraphs --- secure total domination --- rooted product graph --- Roman domination number --- perfect Roman domination number --- strong resolving graph --- strong metric dimension --- strong resolving set --- cactus graphs --- unicyclic graphs --- network science --- network curvature --- discrete Ricci curvature --- earth-mover’s distance
Choose an application
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.
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
This book includes 15 articles published in the Special Issue "Theoretical Computer Science and Discrete Mathematics" of Symmetry (ISSN 2073-8994). This Special Issue is devoted to original and significant contributions to theoretical computer science and discrete mathematics. The aim was to bring together research papers linking different areas of discrete mathematics and theoretical computer science, as well as applications of discrete mathematics to other areas of science and technology. The Special Issue covers topics in discrete mathematics including (but not limited to) graph theory, cryptography, numerical semigroups, discrete optimization, algorithms, and complexity.
Research & information: general --- Mathematics & science --- fuzzy set --- n-Pythagorean --- n-PFS algebra --- triangular norms --- outer-independent Roman domination --- Roman domination --- vertex cover --- rooted product graph --- total domination --- domination --- secure domination --- secure Italian domination --- weak roman domination --- w-domination --- cryptanalysis --- group key establishment --- topology optimization --- optimization --- filtering --- method --- penalization --- weight factor --- FEM --- MATLAB --- SIMP --- estimated prime factor --- integer factorisation problem --- continued fraction --- Fermat's Factoring Algorithm --- genetic algorithm --- AES(t) --- heuristics --- microaggregation --- statistical disclosure control --- graph theory --- traveling salesman problem --- data privacy --- location privacy --- differentials in graphs --- strong differential --- quasi-total strong differential --- quasi-total Italian domination number --- numerical semigroup --- forest --- ordinarization transform --- quasi-ordinarization transform --- load redistribution --- leveling power consumption per phase --- three-phase asymmetric distribution networks --- ideal power consumption --- mixed-integer convex optimization --- strongly total Roman domination --- total Roman domination --- lexicographic product graph --- improved crow search algorithm --- normal Gaussian distribution --- phase swapping problem --- power losses --- asymmetric distribution grids --- vortex search algorithm --- nonidentical parallel production lines --- axle housing machining --- mixed model production --- eligibility constraint --- fuzzy due date --- grey wolf optimizer --- fuzzy set --- n-Pythagorean --- n-PFS algebra --- triangular norms --- outer-independent Roman domination --- Roman domination --- vertex cover --- rooted product graph --- total domination --- domination --- secure domination --- secure Italian domination --- weak roman domination --- w-domination --- cryptanalysis --- group key establishment --- topology optimization --- optimization --- filtering --- method --- penalization --- weight factor --- FEM --- MATLAB --- SIMP --- estimated prime factor --- integer factorisation problem --- continued fraction --- Fermat's Factoring Algorithm --- genetic algorithm --- AES(t) --- heuristics --- microaggregation --- statistical disclosure control --- graph theory --- traveling salesman problem --- data privacy --- location privacy --- differentials in graphs --- strong differential --- quasi-total strong differential --- quasi-total Italian domination number --- numerical semigroup --- forest --- ordinarization transform --- quasi-ordinarization transform --- load redistribution --- leveling power consumption per phase --- three-phase asymmetric distribution networks --- ideal power consumption --- mixed-integer convex optimization --- strongly total Roman domination --- total Roman domination --- lexicographic product graph --- improved crow search algorithm --- normal Gaussian distribution --- phase swapping problem --- power losses --- asymmetric distribution grids --- vortex search algorithm --- nonidentical parallel production lines --- axle housing machining --- mixed model production --- eligibility constraint --- fuzzy due date --- grey wolf optimizer
Choose an application
This book includes 15 articles published in the Special Issue "Theoretical Computer Science and Discrete Mathematics" of Symmetry (ISSN 2073-8994). This Special Issue is devoted to original and significant contributions to theoretical computer science and discrete mathematics. The aim was to bring together research papers linking different areas of discrete mathematics and theoretical computer science, as well as applications of discrete mathematics to other areas of science and technology. The Special Issue covers topics in discrete mathematics including (but not limited to) graph theory, cryptography, numerical semigroups, discrete optimization, algorithms, and complexity.
Research & information: general --- Mathematics & science --- fuzzy set --- n-Pythagorean --- n-PFS algebra --- triangular norms --- outer-independent Roman domination --- Roman domination --- vertex cover --- rooted product graph --- total domination --- domination --- secure domination --- secure Italian domination --- weak roman domination --- w-domination --- cryptanalysis --- group key establishment --- topology optimization --- optimization --- filtering --- method --- penalization --- weight factor --- FEM --- MATLAB --- SIMP --- estimated prime factor --- integer factorisation problem --- continued fraction --- Fermat’s Factoring Algorithm --- genetic algorithm --- AES(t) --- heuristics --- microaggregation --- statistical disclosure control --- graph theory --- traveling salesman problem --- data privacy --- location privacy --- differentials in graphs --- strong differential --- quasi-total strong differential --- quasi-total Italian domination number --- numerical semigroup --- forest --- ordinarization transform --- quasi-ordinarization transform --- load redistribution --- leveling power consumption per phase --- three-phase asymmetric distribution networks --- ideal power consumption --- mixed-integer convex optimization --- strongly total Roman domination --- total Roman domination --- lexicographic product graph --- improved crow search algorithm --- normal Gaussian distribution --- phase swapping problem --- power losses --- asymmetric distribution grids --- vortex search algorithm --- nonidentical parallel production lines --- axle housing machining --- mixed model production --- eligibility constraint --- fuzzy due date --- grey wolf optimizer --- n/a --- Fermat's Factoring Algorithm
Choose an application
This book includes 15 articles published in the Special Issue "Theoretical Computer Science and Discrete Mathematics" of Symmetry (ISSN 2073-8994). This Special Issue is devoted to original and significant contributions to theoretical computer science and discrete mathematics. The aim was to bring together research papers linking different areas of discrete mathematics and theoretical computer science, as well as applications of discrete mathematics to other areas of science and technology. The Special Issue covers topics in discrete mathematics including (but not limited to) graph theory, cryptography, numerical semigroups, discrete optimization, algorithms, and complexity.
fuzzy set --- n-Pythagorean --- n-PFS algebra --- triangular norms --- outer-independent Roman domination --- Roman domination --- vertex cover --- rooted product graph --- total domination --- domination --- secure domination --- secure Italian domination --- weak roman domination --- w-domination --- cryptanalysis --- group key establishment --- topology optimization --- optimization --- filtering --- method --- penalization --- weight factor --- FEM --- MATLAB --- SIMP --- estimated prime factor --- integer factorisation problem --- continued fraction --- Fermat’s Factoring Algorithm --- genetic algorithm --- AES(t) --- heuristics --- microaggregation --- statistical disclosure control --- graph theory --- traveling salesman problem --- data privacy --- location privacy --- differentials in graphs --- strong differential --- quasi-total strong differential --- quasi-total Italian domination number --- numerical semigroup --- forest --- ordinarization transform --- quasi-ordinarization transform --- load redistribution --- leveling power consumption per phase --- three-phase asymmetric distribution networks --- ideal power consumption --- mixed-integer convex optimization --- strongly total Roman domination --- total Roman domination --- lexicographic product graph --- improved crow search algorithm --- normal Gaussian distribution --- phase swapping problem --- power losses --- asymmetric distribution grids --- vortex search algorithm --- nonidentical parallel production lines --- axle housing machining --- mixed model production --- eligibility constraint --- fuzzy due date --- grey wolf optimizer --- n/a --- Fermat's Factoring Algorithm
Listing 1 - 7 of 7 |
Sort by
|