Listing 1 - 10 of 36 | << page >> |
Sort by
|
Choose an application
Science --- Artificial intelligence. Robotics. Simulation. Graphics --- graphs
Choose an application
Graph theory. --- Graph theory --- Graphs, Theory of --- Theory of graphs --- Combinatorial analysis --- Topology --- Extremal problems
Choose an application
Computer science --- Graph theory --- Computer science. --- Data processing --- Graphs, Theory of --- Theory of graphs --- Combinatorial analysis --- Topology --- Informatics --- Science --- Extremal problems
Choose an application
Graph theory. --- Machine learning. --- Learning, Machine --- Artificial intelligence --- Machine theory --- Graph theory --- Graphs, Theory of --- Theory of graphs --- Combinatorial analysis --- Topology --- Extremal problems --- Teoria de grafs --- Aprenentatge automàtic
Choose an application
Computer science --- Graph theory --- Computer science. --- Data processing --- Graphs, Theory of --- Theory of graphs --- Combinatorial analysis --- Topology --- Informatics --- Science --- Extremal problems
Choose an application
Graph theory. --- Integrated circuits --- Very large scale integration. --- Very large scale integration of circuits --- VLSI circuits --- Graph theory --- Graphs, Theory of --- Theory of graphs --- Combinatorial analysis --- Topology --- Extremal problems
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
Teoria de grafs --- Mathematica (Llenguatge de programació) --- Anàlisi combinatòria --- Topologia --- Anàlisi de xarxes (Planificació) --- Arbres (Teoria de grafs) --- Matroides --- Teoria de Ramsey --- Xarxes de Petri --- Teoria de l'aparellament --- Llenguatges de programació --- Mathematics. --- Graph theory. --- Graph theory --- Graphs, Theory of --- Theory of graphs --- Combinatorial analysis --- Topology --- Math --- Science --- Extremal problems
Choose an application
This book highlights cutting-edge research in the field of network science, offering scientists, researchers, students, and practitioners a unique update on the latest advances in theory and a multitude of applications. It presents the peer-reviewed proceedings of the X International Conference on Complex Networks and their Applications (COMPLEX NETWORKS 2021). The carefully selected papers cover a wide range of theoretical topics such as network models and measures; community structure, network dynamics; diffusion, epidemics and spreading processes; resilience and control as well as all the main network applications, including social and political networks; networks in finance and economics; biological and neuroscience networks, and technological networks.
Nonlinear theories. --- Nonlinear problems --- Nonlinearity (Mathematics) --- Calculus --- Mathematical analysis --- Mathematical physics --- Dynamics. --- Computational intelligence. --- Graph theory. --- Applied Dynamical Systems. --- Computational Intelligence. --- Graph Theory. --- Graph theory --- Graphs, Theory of --- Theory of graphs --- Combinatorial analysis --- Topology --- Intelligence, Computational --- Artificial intelligence --- Soft computing --- Dynamical systems --- Kinetics --- Mathematics --- Mechanics, Analytic --- Force and energy --- Mechanics --- Physics --- Statics --- Extremal problems
Choose an application
This textbook covers a diversity of topics in graph and network theory, both from a theoretical standpoint, and from an applied modelling point of view. Mathematica® is used to demonstrate much of the modelling aspects. Graph theory and model building tools are developed in tandem with effective techniques for solving practical problems via computer implementation. The book is designed with three primary readerships in mind. Individual syllabi or suggested sequences for study are provided for each of three student audiences: mathematics, applied mathematics/operations research, and computer science. In addition to the visual appeal of each page, the text contains an abundance of gems. Most chapters open with real-life problem descriptions which serve as motivation for the theoretical development of the subject matter. Each chapter concludes with three different sets of exercises. The first set of exercises are standard and geared toward the more mathematically inclined reader. Many of these are routine exercises, designed to test understanding of the material in the text, but some are more challenging. The second set of exercises is earmarked for the computer technologically savvy reader and offer computer exercises using Mathematica. The final set consists of larger projects aimed at equipping those readers with backgrounds in the applied sciences to apply the necessary skills learned in the chapter in the context of real-world problem solving. Additionally, each chapter offers biographical notes as well as pictures of graph theorists and mathematicians who have contributed significantly to the development of the results documented in the chapter. These notes are meant to bring the topics covered to life, allowing the reader to associate faces with some of the important discoveries and results presented. In total, approximately 100 biographical notes are presented throughout the book.
Mathematics. --- Graph theory. --- Graph theory --- Graphs, Theory of --- Theory of graphs --- Combinatorial analysis --- Topology --- Math --- Science --- Extremal problems --- Teoria de grafs --- Mathematica (Llenguatge de programació) --- Llenguatges de programació --- Anàlisi combinatòria --- Topologia --- Anàlisi de xarxes (Planificació) --- Arbres (Teoria de grafs) --- Matroides --- Teoria de Ramsey --- Xarxes de Petri --- Teoria de l'aparellament
Listing 1 - 10 of 36 | << page >> |
Sort by
|