English
Related papers

Related papers: The Curvature of Graph Products

200 papers

Let f:\Sigma_1 --> \Sigma_2 be a map between compact Riemannian manifolds of constant curvature. This article considers the evolution of the graph of f in the product of \Sigma_1 and \Sigma_2 by the mean curvature flow. Under suitable…

Differential Geometry · Mathematics 2009-11-07 Mu-Tao Wang

The relation between Hamiltonicity and toughness of a graph is a long standing research problem. The paper studies the Hamiltonicity of the Cartesian product graph $G_1\square G_2$ of graphs $G_1$ and $G_2$ satisfying that $G_1$ is…

Combinatorics · Mathematics 2021-12-06 Louis Kao , Chih-wen Weng

We prove a discrete Gauss-Bonnet-Chern theorem which states where summing the curvature over all vertices of a finite graph G=(V,E) gives the Euler characteristic of G.

Differential Geometry · Mathematics 2011-11-24 Oliver Knill

In this work we prove that, given a simplicial graph $\Gamma$ and a family $\mathcal{G}$ of linear groups over a domain $R$, the graph product $\Gamma\mathcal{G}$ is linear over $R[\underline t]$, where $\underline t$ is a tuple of finitely…

Group Theory · Mathematics 2022-03-09 Federico Berlai , Javier de la Nuez González

Solving a long-standing open question in convex geometry, we will show that typical convex surfaces contain points of infinite curvature in all tangent directions. To prove this, we use an easy curvature definition imitating the idea of…

Metric Geometry · Mathematics 2011-09-13 Karim Adiprasito

The generalized $k$-connectivity $\kappa_k(G)$ of a graph $G$, introduced by Chartrand et al., is a natural and nice generalization of the concept of (vertex-)connectivity. In this paper, we prove that for any two connected graphs $G$ and…

Combinatorics · Mathematics 2013-08-13 Xueliang Li , Yaping Mao

Given a finite simplicial graph $\Gamma=(V,E)$ with a vertex-labelling $\varphi:V\rightarrow\left\{\text{non-trivial finitely generated groups}\right\}$, the graph product $G_\Gamma$ is the free product of the vertex groups $\varphi(v)$…

Group Theory · Mathematics 2020-01-09 Olga Varghese

A production function is a mathematical formalization in economics which denotes the relations between the output generated by a firm, an industry or an economy and the inputs that have been used in obtaining it. In this paper, we study the…

Differential Geometry · Mathematics 2017-06-05 Muhittin Evren Aydin , Mahmut Ergut

We prove that every connected graph can be realized as the cut locus of some point on some Riemannian surface $S$ which, in some cases, has constant curvature. We study the stability of such realizations, and their generic behavior.

Differential Geometry · Mathematics 2016-08-14 Jin-ichi Itoh , Costin Vîlcu

A graph is said to be a cover graph if it is the underlying graph of the Hasse diagram of a finite partially ordered set. The direct product G X H of graphs G and H is the graph having vertex set V(G) X V(H) and edge set E(G X H) =…

Combinatorics · Mathematics 2012-02-28 Hsin-Hao Lai , Ko-Wei Lih , Chen-Ying Lin , Li-Da Tong

It was recently proved that every planar graph is a subgraph of the strong product of a path and a graph with bounded treewidth. This paper surveys generalisations of this result for graphs on surfaces, minor-closed classes, various…

Combinatorics · Mathematics 2021-02-18 Zdeněk Dvořák , Tony Huynh , Gwenaël Joret , Chun-Hung Liu , David R. Wood

Given an edge-independent random graph G(n,p), we determine various facts about the cohomology of graph products of groups for the graph G(n,p). In particular, the random graph product of a sequence of finite groups is a rational duality…

Group Theory · Mathematics 2017-05-17 Michael W. Davis , Matthew Kahle

We study a modified notion of Ollivier's coarse Ricci curvature on graphs introduced by Lin, Lu, and Yau in [11]. We establish a rigidity theorem for complete graphs that shows a connected finite simple graph is complete if and only if the…

Combinatorics · Mathematics 2020-11-25 Vincent Bonini , Conor Carroll , Uyen Dinh , Sydney Dye , Joshua Frederick , Erin Pearse

This article investigates the isomorphism problem for graphs derived from the four standard graph products: Cartesian, Kronecker (direct), strong, and lexicographic product. We provide a complete characterization of all simple connected…

Combinatorics · Mathematics 2025-08-07 Priti Prasanna Mondal , M. Rajesh Kannan , Fouzul Atik

In this paper, a function on any pair of graphs is defined whose properties are similar to the properties of dot product in vector space. This function enables us to define graph orthogonality and, also, a new metric on isomorphism classes…

Combinatorics · Mathematics 2018-10-23 Ameneh Farhadian

Let $\kappa(G)$ be the connectivity of $G$ and $G\times H$ the direct product of $G$ and $H$. We prove that for any graphs $G$ and $K_n$ with $n\ge 3$, $\kappa(G\times K_n)=min\{n\kappa(G),(n-1)\delta(G)\}$, which was conjectured by Guji…

Combinatorics · Mathematics 2013-07-09 Wei Wang , Ni-Ni Xue

We introduce a notion of doubly warped product of weighted graphs that is consistent with the doubly warped product in the Riemannian setting. We establish various discrete Bakry-\'Emery Ricci curvature-dimension bounds for such warped…

Differential Geometry · Mathematics 2021-10-26 Zohreh Fathi , Sajjad Lakzian

We investigate whether there is a relationship between the discrete Bakry-\'{E}mery curvature of a graph and the smooth curvature of an ambient surface into which the graph is embedded geodesically. As we used weighted graphs as test…

Combinatorics · Mathematics 2023-11-10 Gökçe Çakmak , Ali Deniz , Şahin Koçak , Murat Limoncu

Dujmovi\'{c}, Joret, Micek, Morin, Ueckerdt, and Wood [J. ACM 2020] established that every planar graph is a subgraph of the strong product of a graph with bounded treewidth and a path. Motivated by this result, this paper systematically…

Combinatorics · Mathematics 2021-10-05 Robert Hickingbotham , David R. Wood

Let $G$ be a connected graph. A vertex $w$ strongly resolves a pair $u$, $v$ of vertices of $G$ if there exists some shortest $u-w$ path containing $v$ or some shortest $v-w$ path containing $u$. A set $W$ of vertices is a strong resolving…

Combinatorics · Mathematics 2013-12-02 Dorota Kuziak , Ismael G. Yero , Juan A. Rodriguez-Velazquez
‹ Prev 1 3 4 5 6 7 10 Next ›