Related papers: On Subgraph Isomorphism
This is an example on the cohomology of threefolds.
In this paper, we give a necessarly and sufficient condition for orbits of linear isotropy representations of Riemannian symmetric spaces are biharmonic submanifolds in hyperspheres in Euclidean spaces. In particular, we obtain examples of…
This paper considers a hyperplane arrangement constructed with a subset of a set of all simple paths in a graph. A connection of the constructed arrangement to the maximum matching problem is established. Moreover, the problem of finding…
We investigate the representation of symmetric polynomials as a sum of squares. Since this task is solved using semidefinite programming tools we explore the geometric, algebraic, and computational implications of the presence of discrete…
This note is about the geometry of the pants graph P(S), a natural simplicial graph associated to a finite type topological surface S where vertices represents pants decompositions. The main result in this note ascserts that for a…
The d-measurement set of a graph is its set of possible squared edge lengths over all d-dimensional embeddings. In this note, we define a new notion of graph isomorphism called d-measurement isomorphism. Two graphs are d-measurement…
The symmetric group on 4 letters has the reflection group $D_{3}$ as an isomorphic image. This fact follows from the coincidence of the root systems $A_{3}$ and $D_{3}$. The isomorphism is used to construct an orthogonal basis of…
We find all polyhedral graphs such that their complements are still polyhedral. These turn out to be all self-complementary.
Primarily this paper presents an expository report on alternatives to the traditional methods of classifying representations of finite dimensional algebras. Some new results illustrating such alternatives for algebras with only finitely…
In this paper, we present two main results. First, by only one conjecture (Conjecture 2.9) for recognizing a vertex symmetric graph, which is the hardest task for our problem, we construct an algorithm for finding an isomorphism between two…
We define totally-isotropic polynomials of alternating matrix spaces over finite fields, by analogy with independence polynomials of graphs. Our main result shows that totally-isotropic polynomials of graphical alternating matrix spaces…
In this paper has been proved the pluripolarity of graphs of algebroid functions
A descent of a labeled acyclic digraph is a directed edge $x\to y$ with $x>y$. In this paper, we find a recurrence for the number of labeled acyclic digraphs with a given number of descents.
It is known that the canonical double cover of any connected nonbipartite graph have an automorphism group of the form $H \rtimes \mathbb{Z}_2$, where $H$ is the set of automorphism which preserve bipartite parts. We construct connected…
We give an algorithm that, for every fixed k, decides isomorphism of graphs of rank width at most k in polynomial time. As the clique width of a graph is bounded in terms of its rank width, we also obtain a polynomial time isomorphism test…
Graph polynomials are graph parameters invariant under graph isomorphisms which take values in a polynomial ring with a fixed finite number of indeterminates. We study graph polynomials from a model theoretic point of view. In this paper we…
We study a simplicial mixed polynomial of cyclic type and its associated weighted homogeneous polynomial. In the present paper, we show that their links are diffeomorphic and their Milnor fibrations are isomorphic.
Determining whether two graphs are structurally identical is a fundamental problem with applications spanning mathematics, computer science, chemistry, and network science. Despite decades of study, graph isomorphism remains a challenging…
A topological index of a graph $G$ is a real number which is preserved under isomorphism. Extensive studies on certain polynomials related to these topological indices have also been done recently. In a similar way, chromatic versions of…
Statistical models on infinite graphs may exhibit inhomogeneous thermodynamic behaviour at macroscopic scales. This phenomenon is of geometrical origin and may be properly described in terms of spectral partitions into subgraphs with well…