相关论文: A class of reconstructible graphs

We show that a quotient group of a CI-group with respect to (di)graphs is a CI-group with respect to (di)graphs.

Subshifts with property $(A)$ are constructed from a class of directed graphs. As special cases the Markov-Dyck shifts are shown to have property $(A)$. The semigroups, that are associated to $\mathcal R$-graph shifts with Property (A), are…

In this paper we introduce the graph $\Gamma_{sc}(G)$ associated with a group $G$, called the solvable conjugacy class graph (abbreviated as SCC-graph), whose vertices are the nontrivial conjugacy classes of $G$ and two distinct conjugacy…

A split graph is a graph whose vertex set can be partitioned into a clique and an independent set. A split comparability graph is a split graph which is transitively orientable. In this work, we characterize split comparability graphs in…

For a set-endofunctor $F$, a graph is triple $(V,E,g)$ with a structure map $g:E\rightarrow F V$. This model is a generalized coalgebra over the category of sets. In this note, we model graphs as coalgebras over $Set\times Set$ and use the…

We classify endomorphisms of the plane that preserve a pencil of curves.

In this study, we obtain the following two families of circulant graphs each has Type-2 isomorphic circulant graphs w.r.t. $m$ such that $m$ has more than one value. (i) Family of circulant graphs $C_{432}(R)$, each has isomorphic circulant…

The goal of this paper is to describe a sufficient condition on cycles in graphs for which the edge ideal is splittable. We give an explicit splitting function for such ideals.

Two complete graphs are connected by adding some edges. The obtained graph is called the gluing graph. The more we add edges, the larger the Ricci curvature on it becomes. We calculate the Ricci curvature of each edge on the gluing graph…

We prove that graph products of sofic groups are sofic, as are graphs of groups for which vertex groups are sofic and edge groups are amenable.

Besides the need for a better understanding of networks, there is a need for prescriptive models and tools to specify requirements concerning networks and their associated graph representations. We propose class-based graphs as a means to…

A new kind of diagrams is presented, showing the causal structure of bimetric interactions.

A construction sequence for a graph is a listing of the elements of the graph (the set of vertices and edges) such that each edge follows both its endpoints. The construction number of the graph is the number of such sequences. We determine…

We collect some general results on graph limits associated to hereditary classes of graphs. As examples, we consider some classes defined by forbidden subgraphs and some classes of intersection graphs, including triangle-free graphs,…

We classify the connected graphs with precisely three distinct eigenvalues and second largest eigenvalue at most 1.

In this paper we introduced an arithmetic graph function which associates with every group G the directed graph whose vertices corresponds to the divisors of |G|. With the help of such functions we introduced arithmetic graphs of classes of…

Graph is a universe data structure that is widely used to organize data in real-world. Various real-word networks like the transportation network, social and academic network can be represented by graphs. Recent years have witnessed the…

In this study we consider the problem of triangulated graphs. Precisely we give a necessary and sufficient condition for a graph to be triangulated. This give an alternative characterization of triangulated graphs. Our method is based on…

We give an analysis of defeasible inheritance diagrams, also from the perspective of reactive diagrams.

The $k$-deck of a graph is the multiset of its subgraphs induced by $k$ vertices. A graph or graph property is $l$-reconstructible if it is determined by the deck of subgraphs obtained by deleting $l$ vertices. We show that the degree list…