Related papers: Graph Theory
This paper has been withdrawn by the authors. It has been replaced by the papers: "Drawings of Planar Graphs with Few Slopes and Segments" (math/0606450) and "Graph Drawings with Few Slopes" (math/0606446).
Given the degree sequence $d$ of a graph, the realization graph of $d$ is the graph having as its vertices the labeled realizations of $d$, with two vertices adjacent if one realization may be obtained from the other via an edge-switching…
The degree sequence of a graph is a numerical method to characterize the properties of graphs. Generalized forms of degree sequences exist for complete graphs and complete graphs. Nikolopolus et al. characterized the number of spanning…
Graphs are used in many disciplines to model the relationships that exist between objects in a complex discrete system. Researchers may wish to compare a network of interest to a "typical" graph from a family (or ensemble) of graphs which…
We have developed a mathematical theory of the topological vertex--a theory that was original proposed by M. Aganagic, A. Klemm, M. Marino, and C. Vafa in hep-th/0305132 on effectively computing Gromov-Witten invariants of smooth toric…
We introduce the P\'olya threshold graph model and derive its stochastic and algebraic properties. This random threshold graph is generated sequentially via a two-color P\'olya urn process. Starting from an empty graph, each time step…
In this chapter (Chapter V) we present several results which demonstrate a close connection and useful exchange of ideas between graph theory and knot theory. These disciplines were shown to be related from the time of Tait (if not Listing)…
Recently, we have introduced and modified two graph-decomposition theorems based on a new graph product, motivated by applications in the context of synchronising periodic real-time processes. This vertex-removing synchronised product…
This is an item on Ramanujan Graphs for a planned encyclopedia on Ramanujan. The notion of Ramanujan graphs is explained, as well as the reason to name these graphs after Ramanujan.
The notion of p-competition graphs of digraphs was introduced by S-R. Kim, T. A. McKee, F. R. McMorris, and F. S. Roberts [p-competition graphs, Linear Algebra Appl., 217 (1995) 167--178] as a generalization of the competition graphs of…
This paper has been divided into three papers. arXiv:0809.3232, arXiv:0808.4134, arXiv:cs/0607105
Graphs are essential representations in the professions and education concerning the science, technology, engineering, and mathematics (STEM) disciplines. Beyond their academic relevance, graphs find extensive utility in everyday scenarios,…
Random graphs have played an instrumental role in modelling real-world networks arising from the internet topology, social networks, or even protein-interaction networks within cells. Percolation, on the other hand, has been the fundamental…
We study the degree distribution of a randomly chosen vertex in a duplication--divergence graph, under a variety of different generalizations of the basic model of Bhan, Galas and Dewey (2002) and V\'azquez, Flammini, Maritan and Vespignani…
The topic of this treatise is a combinatorial technique called Graph Pebbling. We investigate pebbling numbers, weight functions, flow networks, hypercubes, and the zero-sum conjecture of Erd\H{o}s and Lemke. This investigation is a…
Graphs are common mathematical structures that are visual and intuitive. They constitute a natural and seamless way for system modelling in science, engineering and beyond, including computer science, biology, business process modelling,…
This book presents a comprehensive and systematic survey of graph theory under uncertainty, with particular emphasis on the unifying role of the uncertain graph framework. It reviews fundamental concepts, structural properties, graph…
Graphs and networks play an important role in modeling and analyzing complex interconnected systems such as transportation networks, integrated circuits, power grids, citation graphs, and biological and artificial neural networks. Graph…
These lecture notes have been converted to a book titled Network Information Theory published recently by Cambridge University Press. This book provides a significantly expanded exposition of the material in the lecture notes as well as…
According to Paul Erd\H{o}s [Some notes on Tur\'an's mathematical work, J. Approx. Theory 29 (1980), page 4] it was Paul Tur\'an who "created the area of extremal problems in graph theory". However, without a doubt, Paul Erd\H{o}s…