نتایج جستجو برای: equivalence graph
تعداد نتایج: 232872 فیلتر نتایج به سال:
Synchronising Graphs is a system of parallel graph transformation designed for modeling process interaction in a network environment. Although notions of observational equivalence are abundant in the literature for process calculi, not so for graph rewriting, where system behaviour is typically context dependent. We propose a theory of context-free synchronising graphs and a novel notion of bis...
We consider the problem of finding a measurable unfriendly partition of the vertex set of a locally finite Borel graph on standard probability space. After isolating a sufficient condition for the existence of such a partition, we show how it settles the dynamical analog of the problem (up to weak equivalence) for graphs induced by free, measurepreserving actions of groups with designated finit...
By h(G, x) and P (G, λ) we denote the adjoint polynomial and the chromatic polynomial of graph G, respectively. A new invariant of graph G, which is the fourth character R4(G), is given in this paper. Using the properties of the adjoint polynomials, the adjoint equivalence class of graph Bn−6,1,2 is determined, which can be regarded as the continuance of the paper written by Wang et al. [J. Wan...
The k -dimensional Weisfeiler-Leman procedure ( - WL ), which colors -tuples of vertices in rounds based on the neighborhood structure graph, has proven to be immensely fruitful algorithmic study Graph Isomorphism. More generally, it is fundamental importance understanding and exploiting symmetries graphs various settings. Two are -equivalent if produces same final coloring both graphs. 1 -equi...
The essential graph is a distinguished member of a Markov equivalence class of AMP chain graphs. However, the directed edges in the essential graph are not necessarily strong or invariant, i.e. they may not be shared by every member of the equivalence class. Likewise for the undirected edges. In this paper, we develop a procedure for identifying which edges in an essential graph are strong. We ...
We show that there is a complete, consistent Borel theory which has no “Borel model” in the following strong sense: There is no structure satisfying the theory for which the elements of the structure are equivalence classes under some Borel equivalence relation and the interpretations of the relations and function symbols are Borel in the natural sense. We also investigate Borel isomorphisms be...
A geometric graph G is a simple graph G together with a straight line drawing of G in the plane with the vertices in general position. Two geometric realizations of a simple graph are geo-isomorphic if there is a vertex bijection between them that preserves vertex adjacencies and non-adjacencies, as well as edge crossings and non-crossings. A natural extension of graph homomorphisms, geo-homomo...
A geometric graph G is a simple graph G together with a straight line drawing of G in the plane with the vertices in general position. Two geometric realizations of a simple graph are geo-isomorphic if there is a vertex bijection between them that preserves vertex adjacencies and non-adjacencies, as well as edge crossings and non-crossings. A natural extension of graph homomorphisms, geo-homomo...
Two edge colorings of a graph are edge-Kempe equivalent if one can be obtained from the other by a series of edge-Kempe switches. This work gives some results for the number of edge-Kempe equivalence classes for cubic graphs. In particular we show every 2-connected planar bipartite cubic graph has exactly one edge-Kempe equivalence class. Additionally, we exhibit infinite families of nonplanar ...
Generalizing results of Temperley [11], Brooks, Smith, Stone and Tutte [1] and others [10, 7] we describe a natural equivalence between three planar objects: weighted bipartite planar graphs; planar Markov chains; and tilings with convex polygons. This equivalence provides a measure-preserving bijection between dimer coverings of a weighted bipartite planar graph and spanning trees of the corre...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید