Generalized uniformly line vulnerable digraphs
Generalizing the Ramsey problem through diameter.
Generating Closed 2-Cell Embeddings in the Torus and the Projective Plane.
Generating hamiltionian cycles in complete graphs.
Generating potentially nilpotent full sign patterns.
Genus distribution of graphs under surgery: adding edges and splitting vertices.
Geodesics and steps in a connected graph
Geodetic graphs of diameter two
Geodetic graphs which are homeomorphic to complete graphs
Geodetic line, middle and total graphs
Geodetic sets in graphs
For two vertices u and v of a graph G, the closed interval I[u,v] consists of u, v, and all vertices lying in some u-v geodesic in G. If S is a set of vertices of G, then I[S] is the union of all sets I[u,v] for u, v ∈ S. If I[S] = V(G), then S is a geodetic set for G. The geodetic number g(G) is the minimum cardinality of a geodetic set. A set S of vertices in a graph G is uniform if the distance between every two distinct vertices of S is the same fixed number. A geodetic set is essential if for...
Geodetic topological cycles in locally finite graphs.
Geography played on an -cycle times a 4-cycle.
Geometric algorithms and combinatorial optimization [Book]
Geometric algorithms and combinatorial optimization [Book]
Geometric simultaneous embeddings of a graph and a matching.
Geometric structures on toroidal maps and elliptic curves
Geometric thickness of complete graphs.
Géométrie et analyse sur les arbres
Giant vacant component left by a random walk in a random d-regular graph
We study the trajectory of a simple random walk on a d-regular graph with d ≥ 3 and locally tree-like structure as the number n of vertices grows. Examples of such graphs include random d-regular graphs and large girth expanders. For these graphs, we investigate percolative properties of the set of vertices not visited by the walk until time un, where u > 0 is a fixed positive parameter. We show that this so-called vacant set exhibits a phase transition in u in the following sense: there...