We compute the Betti numbers of the edge rings of multi-path graphs using the induced-subgraph method introduced in [19]. Here, a multi-path graph refers to a simple graph consisting of two vertices and multiple paths...
详细信息
Degree Based Logical Adjacency Checking (DBLAC). An efficient coloring of graphs with unique logical AND operations. The logical AND operation shows More effective color assignment and fewer number of induced in the c...
详细信息
A mixed regular graph is a graph where every vertex has z incoming arcs, z outgoing arcs, and r edges;furthermore, if it has girth g, we say that the graph is a [z, r;g]-mixed graph. A [z, r;g]-mixed cage is a [z, r;g...
详细信息
We investigate the structure of graphs of twin-width at most 1, and obtain the following results: graphs of twin-width at most 1 are permutation graphs. In particular they have an intersection model and a linear struc...
详细信息
We investigate the chromatic number problem, a classic NP-complete problem identified by Karp among his 21 seminal problems. The chromatic number of a graph G is the smallest integer k such that each vertex of G can b...
详细信息
The famous Conway–Gordon–Sachs theorem for the complete graph on six vertices was extended to the general complete graph on n vertices by Kazakov–Korablev as a congruence modulo 2, and its integral lift was given b...
详细信息
Looped Transformers have shown exceptional neural algorithmic reasoning capability in simulating traditional graph algorithms, but their application to more complex structures like hypergraphs remains underexplored. H...
详细信息
We introduce the class of interval H-graphs, which is the generalization of interval graphs, particularly interval bigraphs. For a fixed graph H with vertices a1, a2, . . ., ak, we say that an input graph G with given...
详细信息
Given two input graphs, finding the largest subgraph that occurs in both, i.e., finding the maximum common subgraph, is a fundamental operator for evaluating the similarity between two graphs in graph data analysis. E...
详细信息
The tree spanner problem for a graph G is as follows: For a given integer k, is there a spanning tree T of G (called a tree k-spanner) such that the distance in T between every pair of vertices is at most k times thei...
详细信息
暂无评论