English
Related papers

Related papers: Naji's characterization of circle graphs

200 papers

We prove Gagliardo-Nirenberg inequalities on some classes of manifolds, Lie groups and graphs.

Analysis of PDEs · Mathematics 2008-04-09 Nadine Badr

For a flexible labeling of a graph, it is possible to construct infinitely many non-equivalent realizations keeping the distances of connected points constant. We give a combinatorial characterization of graphs that have flexible labelings.…

Combinatorics · Mathematics 2019-09-17 Georg Grasegger , Jan Legerský , Josef Schicho

We present lower and upper bounds for the geometric-arithmetic index of unicyclic graphs and provide extremal graphs for the corresponding bounds.

Combinatorics · Mathematics 2023-01-20 Sunyo Moon , Seungkook Park

A simple graph $G=(V,E)$ is a $(2,1)$-circuit if $|E|=2|V|$ and $|E(H)|\leq 2|V(H)|-1$ for every proper subgraph $H$ of $G$. Motivated, in part, by ongoing work to understand unique realisations of graphs on surfaces, we derive a…

Combinatorics · Mathematics 2018-01-09 Thomas A McCourt , Anthony Nixon

We give a characterization of Pfaffian graphs in terms of even orientations, extending the characterization of near bipartite non--pfaffian graphs by Fischer and Little \cite{FL}. Our graph theoretical characterization is equivalent to the…

Combinatorics · Mathematics 2021-10-07 Marièn Abreu , Domenico Labbate , Federico Romaniello , John Sheehan

In this paper we investigate a spectra of the Laplacian matrix of cyclic groups using the properties of their characteristic polynomials. We have proved several assertions about the relationship between the spectra of different groups.

Representation Theory · Mathematics 2011-05-19 Dmitriy Goltsov

In this paper, we propose a generalization of a congruence due to Carlitz.

Number Theory · Mathematics 2007-05-23 Hao Pan

In this note we give a combinatorial characterization of all the unmixed bipartite graphs.

Combinatorics · Mathematics 2011-04-05 Rafael H. Villarreal

Let $G$ be an undirected graph of order $n$ and let $C_i$ be an $i$-cycle graph. $G$ is called pancyclic if $G$ contains a $C_i$ for any $i\in \{3,4,\ldots,n\}$. We show that the pancyclicity of specific Cayley graphs and the Cartesian…

Combinatorics · Mathematics 2023-09-06 Yusaku Nishimura

We show that if a graph contains few induced copies of a given graph then its edges are distribited unevenly.

Combinatorics · Mathematics 2007-05-23 Vladimir Nikiforov

By using Alexander duality on simplicial complexes we give a new and algebraic proof of Dirac's theorem on chordal graphs.

Commutative Algebra · Mathematics 2007-05-23 Jürgen Herzog , Takayuki Hibi , Xinxian Zheng

We present new combinatorial insights into the calculation of (Castelnuovo-Mumford) regularity of graphs.

Combinatorics · Mathematics 2015-03-23 Turker Biyikoglu , Yusuf Civan

We study some versions of the statement of Hadwiger's conjecture for finite as well as infinite graphs.

Combinatorics · Mathematics 2016-10-04 Dominic van der Zypen

In this paper, we consider the Ricci curvature of a directed graph, based on Lin-Lu-Yau's definition. We give some properties of the Ricci curvature, including conditions for a directed regular graph to be Ricci-flat. Moreover, we calculate…

Combinatorics · Mathematics 2018-08-24 Taiki Yamada

Here we simplify the proof of the de Rham theorem for Schwartz functions on affine Nash manifolds and generalize the result to the case of non affine Nash manifolds.

Algebraic Geometry · Mathematics 2013-10-04 Luca Prelli

A kei on $[n]$ can be thought of as a set of maps $(f_x)_{x \in [n]}$, where each $f_x$ is an involution on $[n]$ such that $(x)f_x = x$ for all $x$ and $f_{(x)f_y} = f_yf_xf_y$ for all $x$ and $y$. We can think of kei as loopless,…

Combinatorics · Mathematics 2016-10-20 Matthew Ashford

We obtain a Bernstein type result for entire two dimensional minimal graphs in $\mathbb{R}^{4}$, which extends a previous one due to L. Ni. Moreover, we provide a characterization for complex analytic curves.

Differential Geometry · Mathematics 2008-06-03 Th. Hasanis , A. Savas-Halilaj , Th. Vlachos

We find a class of block graphs whose binomial edge ideals have minimal regularity. As a consequence, we characterize the trees whose binomial edge ideals have minimal regularity. Also, we show that the binomial edge ideal of a block graph…

Commutative Algebra · Mathematics 2014-02-11 Faryal Chaudhry , Ahmet Dokuyucu , Rida Irfan

A cyclic subgroup graph of a group $G$ is a graph whose vertices are cyclic subgroups of $G$ and two distinct vertices $H_1$ and $H_2$ are adjacent if $H_1\leq H_2$, and there is no subgroup $K$ such that $H_1<K<H_2$. M.T\u{a}rn\u{a}uceanu…

Group Theory · Mathematics 2024-09-24 Khyati Sharma , A. Satyanarayana Reddy

This paper presents a new characterisation of the Fermat curve, according to the arrangement of Galois points.

Algebraic Geometry · Mathematics 2024-04-16 Satoru Fukasawa
‹ Prev 1 3 4 5 6 7 10 Next ›