نتایج جستجو برای: non regular graphs
تعداد نتایج: 1503387 فیلتر نتایج به سال:
A graph is said to be reconstructible if it is determined up to isomorphism from the collection of all its one-vertex deleted unlabeled subgraphs. Reconstruction Conjecture (RC) asserts that all graphs on at least three vertices are reconstructible. In this paper, we prove that interval-regular graphs and some new classes of graphs are reconstructible and show that RC is true if and only if all...
A graph is called almost self-complementary if it is isomorphic to one of its almost complements Xc − I, where Xc denotes the complement of X and I a perfect matching (1-factor) in Xc. Almost self-complementary circulant graphs were first studied by Dobson and Šajna in 2004. In this paper we investigate some of the properties and constructions of general almost self-complementary graphs. In par...
We introduce a technique using non-backtracking random walk for estimating the spectral radius of simple random walk. This technique relates the density of non-trivial cycles in simple random walk to that in non-backtracking random walk. We apply this to infinite Ramanujan graphs, which are regular graphs whose spectral radius equals that of the tree of the same degree. Kesten showed that the o...
The main result of this article is a classification of distance-regular Cayley graphs on dihedral groups. There exist four obvious families of such graphs, which are called trivial. These are: complete graphs, complete bipartite graphs, complete bipartite graphs with the edges of a 1-factor removed, and cycles. It is proved that every nontrivial distance-regular Cayley graph on a dihedral group...
the degree kirchhoff index of a connected graph $g$ is defined as the sum of the terms $d_i,d_j,r_{ij}$ over all pairs of vertices, where $d_i$ is the degree of the $i$-th vertex, and $r_{ij}$ the resistance distance between the $i$-th and $j$-th vertex of $g$. bounds for the degree kirchhoff index of the line and para-line graphs are determined. the special case of regular grap...
Switching of Edges in Strongly Regular Graphs I: A Family of Partial Difference Sets on 100 Vertices
We present 15 new partial difference sets over 4 non-abelian groups of order 100 and 2 new strongly regular graphs with intransitive automorphism groups. The strongly regular graphs and corresponding partial difference sets have the following parameters: (100,22,0,6), (100,36,14,12), (100,45,20,20), (100,44,18,20). The existence of strongly regular graphs with the latter set of parameters was a...
We give a systematic development of the application of matrix norms to rapid mixing in spin systems. We show that rapid mixing of both random update Glauber dynamics and systematic scan Glauber dynamics occurs if any matrix norm of the associated dependency matrix is less than 1. We give improved analysis for the case in which the diagonal of the dependency matrix is 0 (as in heat bath dynamics...
This paper aims to develop a theory for studying Cayley graphs, especially for those with a high degree of symmetry. The theory consists of analysing several types of basic Cayley graphs (normal, bi-normal, and corefree), and analysing several operations of Cayley graphs (core quotient, normal quotient, and imprimitive quotient). It provides methods for constructing and characterising various c...
Over ten years ago Wright [4] proved a fundamental theorem in the theory of random graphs. He showed that if M = M(n) is such that almost no labelled graph of order n and size M has two isolated vertices or two vertices of degree n — 1, then the number of labelled graphs of order n and size M divided by the number of unlabelled graphs of order n and size M is asymptotic to n\. The result is bes...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید