Related papers: Graph Theory
In this paper, we hope to bring closer graph theory and consensus algorithms. Firstly, we give a brief introduction to graph theory by listing a concise definition. Then we analyze and visualize some commonly used graphs. Secondly, we…
In this paper, we present a survey of the use of graph theoretical techniques in Biology. In particular, we discuss recent work on identifying and modelling the structure of bio-molecular networks, as well as the application of centrality…
We investigate a method of generating a graph $G=(V,E)$ out of an ordered list of $n$ distinct real numbers $a_1, \dots, a_n$. These graphs can be used to test for the presence of interesting structure in the sequence. We describe sequences…
In this work, which was inspired by the article [2] by M. V. Velasco and A. R. Villena, we obtain a characterization for probably continuous operators and show that the probability of a linear random operator being continuous coincides with…
Social Network Analysis is the use of Network and Graph Theory to study social phenomena, which was found to be highly relevant in areas like Criminology. This chapter provides an overview of key methods and tools that may be used for the…
In this note, we give short inductive proofs of two known results on $k$-extendible graphs based on a property proved in [Qinglin Yu, A note on $n$-extendable graphs. Journal of Graph Theory, 16:349-353, 1992].
This book is a manual for the course of electrodynamics and theory of relativity. It is recommended primarily for students of mathematical departments. This defines its style: I use elements of vectorial and tensorial analysis, differential…
In this paper, we give a class of reconstructible graphs.
By proving graph theoretical versions of Green-Stokes, Gauss-Bonnet and Poincare-Hopf, core ideas of undergraduate mathematics can be illustrated in a simple graph theoretical setting. In this pedagogical exposition we present the main…
Given an integer $r\gs 2$, an important theorem first proved by B. Andr\'asfai, P. Erd\H{o}s, and V. T. S\'os states that any $K_{r+1}$--free graph on $n$ vertices whose minimum degree is greater than $(3r-4)n/(3r-1)$ is $r$--colourable,…
In [A. V. Ivashchenko, Contractible transformations do not change the homology groups of graphs, Discrete Mathematics 126 (1) (1994) p 159,170], Ivashchenko started with the study of contractible graphs, he began with this because they have…
In the last decades, the study of models for large real-world networks has been a very popular and active area of research. A reasonable model should not only replicate all the structural properties that are observed in real world networks…
As is well known, a graph is a mathematical object modeling the existence of a certain relation between pairs of elements of a given set. Therefore, it is not surprising that many of the first results concerning graphs made reference to…
The Erd\H{o}s, Gr\"unwald, and Weiszfeld theorem is a characterization of those infinite graphs which are Eulerian. That is, infinite graphs that admit infinite Eulerian paths. In this article we prove an effective version of the Erd\H{o}s,…
A graph theoretic perspective is taken for a range of phenomena in continuum physics in order to develop representations for analysis of large scale, high-fidelity solutions to these problems. Of interest are phenomena described by partial…
Edge-based percolation methods can be used to analyze disease transmission on complex social networks. This allows us to include complex social heterogeneity in our models while maintaining tractability. Here we review the seminal works on…
For a simple graph $G$, let $n$ and $m$ denote the number of vertices and edges in $G$, respectively. The Erd\H{o}s-Gallai theorem for paths states that in a simple $P_k$-free graph, $m \leq \frac{n(k-1)}{2}$, where $P_k$ denotes a path…
This paper has been withdrawn by the authors; replaced by arXiv:0705.2531v2 [quant-ph].
This work studies certain aspects of graphs embedded on surfaces. Initially, a colored graph model for a map of a graph on a surface is developed. Then, a concept analogous to (and extending) planar graph is introduced in the same spirit as…
Nowadays, exponential random graphs (ERGs) are among the most widely-studied network models. Different analytical and numerical techniques for ERG have been developed that resulted in the well-established theory with true predictive power.…