Page 1

Displaying 1 – 7 of 7

Showing per page

Betti numbers of some circulant graphs

Mohsen Abdi Makvand, Amir Mousivand (2019)

Czechoslovak Mathematical Journal

Let o ( n ) be the greatest odd integer less than or equal to n . In this paper we provide explicit formulae to compute -graded Betti numbers of the circulant graphs C 2 n ( 1 , 2 , 3 , 5 , ... , o ( n ) ) . We do this by showing that this graph is the product (or join) of the cycle C n by itself, and computing Betti numbers of C n * C n . We also discuss whether such a graph (more generally, G * H ) is well-covered, Cohen-Macaulay, sequentially Cohen-Macaulay, Buchsbaum, or S 2 .

Biembeddings of symmetric configurations and 3-homogeneous Latin trades

Mike J. Grannell, Terry S. Griggs, Martin Knor (2008)

Commentationes Mathematicae Universitatis Carolinae

Using results of Altshuler and Negami, we present a classification of biembeddings of symmetric configurations of triples in the torus or Klein bottle. We also give an alternative proof of the structure of 3-homogeneous Latin trades.

Bipartite graphs that are not circle graphs

André Bouchet (1999)

Annales de l'institut Fourier

The following result is proved: if a bipartite graph is not a circle graph, then its complement is not a circle graph. The proof uses Naji’s characterization of circle graphs by means of a linear system of equations with unknowns in GF ( 2 ) .At the end of this short note I briefly recall the work of François Jaeger on circle graphs.

Boolean graphs

Juhani Nieminen (1988)

Commentationes Mathematicae Universitatis Carolinae

Bounds for the number of meeting edges in graph partitioning

Qinghou Zeng, Jianfeng Hou (2017)

Czechoslovak Mathematical Journal

Let G be a weighted hypergraph with edges of size at most 2. Bollobás and Scott conjectured that G admits a bipartition such that each vertex class meets edges of total weight at least ( w 1 - Δ 1 ) / 2 + 2 w 2 / 3 , where w i is the total weight of edges of size i and Δ 1 is the maximum weight of an edge of size 1. In this paper, for positive integer weighted hypergraph G (i.e., multi-hypergraph), we show that there exists a bipartition of G such that each vertex class meets edges of total weight at least ( w 0 - 1 ) / 6 + ( w 1 - Δ 1 ) / 3 + 2 w 2 / 3 , where w 0 is the number...

Currently displaying 1 – 7 of 7

Page 1