Results 111 to 120 of about 1,022,735 (236)
Modelling complex networks by random hierarchical graphs
Condensed Matter Physics, 2008 Numerous complex networks contain special patterns, called network motifs. These are specific subgraphs, which occur oftener than in randomized networks of Erdős-Rényi type.
M.Wróbel
doaj +1 more source
Critical window for the vacant set left by random walk on random regular\n graphs [PDF]
, 2011 Cerny, Jiri, Augusto Teixeira
openalex +1 more source
, 2023 Let G1 and G2 be two undirected graphs. Let u1, v1 ? V ( G1 ) and u2, v2 ? V ( G2 ). A parallel composition forms a new graph H that combines G1 and G2 by contracting the vertices u1 with u2 and v1 with v2. A new kind of graph called a parallel critical graph is introduced in this paper.
openaire +1 more source
Critical Pebbling Numbers of Graphs
, 2015 We define three new pebbling parameters of a connected graph $G$, the $r$-, $g$-, and $u$-critical pebbling numbers. Together with the pebbling number, the optimal pebbling number, the number of vertices $n$ and the diameter $d$ of the graph, this yields 7 graph parameters. We determine the relationships between these parameters.
Gibbons, Courtney R. +2 more
openaire +3 more sources
Infinitely many solutions for three quasilinear Laplacian systems on weighted graphs
Boundary Value ProblemsWe investigate a generalized poly-Laplacian system with a parameter on weighted finite graphs, a generalized poly-Laplacian system with a parameter and Dirichlet boundary value on weighted locally finite graphs, and a ( p , q ) $(p,q)$ -Laplacian system ...
Yan Pang, Junping Xie, Xingyong Zhang
doaj +1 more source
Color-critical graphs and hypergraphs
Journal of Combinatorial Theory, Series B, 1974 Abstract The main purpose of this paper is to present a technique for obtaining constructions of color-critical graphs. The technique consists in reducing color-critical hypergraphs to color-critical graphs, and the constructions obtained generalize and unify known constructions.
openaire +3 more sources
Scaling limits of random graph models at criticality: Universality and the basin of attraction of the Erdős-Rényi random graph [PDF]
, 2014 Shankar Bhamidi +3 more
openalex +1 more source
Supersaturation Beyond Color-Critical Graphs
CombinatoricaThe supersaturation problem for a given graph $F$ asks for the minimum number $h_F(n,q)$ of copies of $F$ in an $n$-vertex graph with $ex(n,F)+q$ edges. Subsequent works by Rademacher, Erdős, and Lovász and Simonovits determine the optimal range of $q$ (which is linear in $n$) for cliques $F$ such that $h_F(n,q)$ equals the minimum number $t_F(n,q)$ of
Ma, Jie, Yuan, Long-Tu
openaire +2 more sources
Classes of critical graphs for tree-depth [PDF]
, 2015 Michael D. Barrus, John Sinkovic
openalex +1 more source