نتایج جستجو برای: non regular graphs
تعداد نتایج: 1503387 فیلتر نتایج به سال:
This is a survey of results on properties of random regular graphs, together with an exposition of some of the main methods of obtaining these results. Related results on asymptotic enumeration are also presented, as well as various generalisations to random graphs with given degree sequence. A major feature in this area is the small subgraph conditioning method. When applicable, this establish...
We analyse an extremal question on the degrees of link graphs a finite regular graph, that is, subgraphs induced by non-trivial spheres. show if $G$ is $d$-regular and connected but not complete then some graph has minimum degree at most $\lfloor 2d/3\rfloor-1$, sufficiently large in terms $d$ d/2\rfloor-1$; both bounds are best possible. also give corresponding best-possible result for problem...
A graph G is k-ordered if for any sequence of k distinct vertices v1, v2, . . . , vk of G there exists a cycle in G containing these k vertices in the specified order. In 1997, Ng and Schultz posed the question of the existence of 3-regular 4-ordered graphs other than K4 and K3,3. In 2008, Meszaros solve the question by proving the Petersen graph and the Heawood graph are 3-regular 4-ordered gr...
Almost all d-regular graphs are Hamiltonian, for d ≥ 3 [8]. In this note we conjecture that in a similar, yet somewhat different, sense almost all cubic non-Hamiltonian graphs are bridge graphs, and present supporting empirical results for this prevalence of the latter among all connected cubic non-Hamiltonian graphs.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید