Choose an application

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

A comprehensive survey of proper connection of graphs is discussed in this book with real world applications in computer science and network security. Beginning with a brief introduction, comprising relevant definitions and preliminary results, this book moves on to consider a variety of properties of graphs that imply bounds on the proper connection number. Detailed proofs of significant advancements toward open problems and conjectures are presented with complete references. Researchers and graduate students with an interest in graph connectivity and colorings will find this book useful as it builds upon fundamental definitions towards modern innovations, strategies, and techniques. The detailed presentation lends to use as an introduction to proper connection of graphs for new and advanced researchers, a solid book for a graduate level topics course, or as a reference for those interested in expanding and further developing research in the area.

Mathematics. --- Combinatorics. --- Graph theory. --- Graph Theory. --- Graph connectivity. --- Connectivity of graphs --- Graph theory --- Combinatorics --- Algebra --- Mathematical analysis --- Graphs, Theory of --- Theory of graphs --- Combinatorial analysis --- Topology --- Extremal problems

Choose an application

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

Key problems and conjectures have played an important role in promoting the development of Ramsey theory, a field where great progress has been made during the past two decades, with some old problems solved and many new problems proposed. The present book will be helpful to readers who wish to learn about interesting problems in Ramsey theory, to see how they are interconnected, and then to study them in depth. This book is the first problem book of such scope in Ramsey theory. Many unsolved problems, conjectures and related partial results in Ramsey theory are presented, in areas such as extremal graph theory, additive number theory, discrete geometry, functional analysis, algorithm design, and in other areas. Most presented problems are easy to understand, but they may be difficult to solve. They can be appreciated on many levels and by a wide readership, ranging from undergraduate students majoring in mathematics to research mathematicians. This collection is an essential reference for mathematicians working in combinatorics and number theory, as well as for computer scientists studying algorithms. ContentsSome definitions and notationsRamsey theoryBi-color diagonal classical Ramsey numbersPaley graphs and lower bounds for R(k, k)Bi-color off-diagonal classical Ramsey numbersMulticolor classical Ramsey numbersGeneralized Ramsey numbersFolkman numbersThe Erdős-Hajnal conjecture Other Ramsey-type problems in graph theory On van der Waerden numbers and Szemeredi's theorem More problems of Ramsey type in additive number theory Sidon-Ramsey numbers Games in Ramsey theory Local Ramsey theory Set-coloring Ramsey theory Other problems and conjectures

Ramsey theory. --- Combinatorial analysis. --- Graph theory. --- Graph theory --- Graphs, Theory of --- Theory of graphs --- Combinatorial analysis --- Topology --- Combinatorics --- Algebra --- Mathematical analysis --- Extremal problems

Choose an application

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

Written by one of the foremost experts in the field, Algebraic Combinatorics is a unique undergraduate textbook that will prepare the next generation of pure and applied mathematicians. The combination of the author’s extensive knowledge of combinatorics and classical and practical tools from algebra will inspire motivated students to delve deeply into the fascinating interplay between algebra and combinatorics. Readers will be able to apply their newfound understanding to mathematical, engineering, and business models. Prerequisites include a basic knowledge of linear algebra over a field, existence of finite fields, and rudiments of group theory. The topics in each chapter build on one another and include extensive problem sets as well as hints to selected exercises. Key topics include walks on graphs, cubes and the Radon transform, the Matrix-Tree Theorem, de Bruijn sequences, the Erdős–Moser conjecture, electrical networks, the Sperner property, shellability of simplicial complexes and face rings. There are also three appendices on purely enumerative aspects of combinatorics related to the chapter material: the RSK algorithm, plane partitions, and the enumeration of labeled trees. The new edition contains a bit more content than intended for a one-semester advanced undergraduate course in algebraic combinatorics, enumerative combinatorics, or graph theory. Instructors may pick and choose chapters/sections for course inclusion and students can immerse themselves in exploring additional gems once the course has ended. A chapter on combinatorial commutative algebra (Chapter 12) is the heart of added material in this new edition. The author gives substantial application without requisites needed for algebraic topology and homological algebra. A sprinkling of additional exercises and a new section (13.8) involving commutative algebra, have been added. From reviews of the first edition: “This gentle book provides the perfect stepping-stone up. The various chapters treat diverse topics … . Stanley’s emphasis on ‘gems’ unites all this —he chooses his material to excite students and draw them into further study. … Summing Up: Highly recommended. Upper-division undergraduates and above.” —D. V. Feldman, Choice, Vol. 51(8), April, 2014.

Mathematics. --- Combinatorics. --- Graph theory. --- Graph Theory. --- Combinatorics --- Algebra --- Mathematical analysis --- Matemática Discreta (4192208) --- Bibliografía recomendada --- Combinatorial analysis. --- Graph theory --- Graphs, Theory of --- Theory of graphs --- Combinatorial analysis --- Topology --- Extremal problems

Choose an application

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

This edited volume offers a detailed account on the theory of directed graphs from the perspective of important classes of digraphs, with each chapter written by experts on the topic. Outlining fundamental discoveries and new results obtained over recent years, this book provides a comprehensive overview of the latest research in the field. It covers core new results on each of the classes discussed, including chapters on tournaments, planar digraphs, acyclic digraphs, Euler digraphs, graph products, directed width parameters, and algorithms. Detailed indices ease navigation while more than 120 open problems and conjectures ensure that readers are immersed in all aspects of the field. Classes of Directed Graphs provides a valuable reference for graduate students and researchers in computer science, mathematics and operations research. As digraphs are an important modelling tool in other areas of research, this book will also be a useful resource to researchers working in bioinformatics, chemoinformatics, sociology, physics, medicine, etc.

Directed graphs. --- Mathematics. --- Algorithms. --- Computer science --- Graph theory. --- Graph Theory. --- Discrete Mathematics in Computer Science. --- Algorithm Analysis and Problem Complexity. --- Digraphs (Graph theory) --- Oriented graphs --- Graph theory --- Computational complexity. --- Computer software. --- Software, Computer --- Computer systems --- Complexity, Computational --- Electronic data processing --- Machine theory --- Computer science—Mathematics. --- Algorism --- Algebra --- Arithmetic --- Graphs, Theory of --- Theory of graphs --- Combinatorial analysis --- Topology --- Foundations --- Extremal problems --- Discrete mathematics. --- Discrete mathematical structures --- Mathematical structures, Discrete --- Structures, Discrete mathematical --- Numerical analysis --- Computer mathematics --- Mathematics

Choose an application

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

This book presents open optimization problems in graph theory and networks. Each chapter reflects developments in theory and applications based on Gregory Gutin’s fundamental contributions to advanced methods and techniques in combinatorial optimization. Researchers, students, and engineers in computer science, big data, applied mathematics, operations research, algorithm design, artificial intelligence, software engineering, data analysis, industrial and systems engineering will benefit from the state-of-the-art results presented in modern graph theory and its applications to the design of efficient algorithms for optimization problems. Topics covered in this work include: · Algorithmic aspects of problems with disjoint cycles in graphs · Graphs where maximal cliques and stable sets intersect · The maximum independent set problem with special classes · A general technique for heuristic algorithms for optimization problems · The network design problem with cut constraints · Algorithms for computing the frustration index of a signed graph · A heuristic approach for studying the patrol problem on a graph · Minimum possible sum and product of the proper connection number · Structural and algorithmic results on branchings in digraphs · Improved upper bounds for Korkel--Ghosh benchmark SPLP instances.

Graph theory. --- Graph theory --- Graphs, Theory of --- Theory of graphs --- Combinatorial analysis --- Topology --- Extremal problems --- Mathematical optimization. --- Business logistics. --- Combinatorics. --- Algorithms. --- Optimization. --- Logistics. --- Graph Theory. --- Supply chain management --- Industrial management --- Logistics --- Optimization (Mathematics) --- Optimization techniques --- Optimization theory --- Systems optimization --- Mathematical analysis --- Maxima and minima --- Operations research --- Simulation methods --- System analysis --- Algorism --- Algebra --- Arithmetic --- Combinatorics --- Foundations