Related papers: A notion of graph homeomorphism
The study of the dynamics of a surface homeomorphism in the neighbourhood of an isolated fixed point leads us to the following results. If the fixed point index is greater than 1, a family of attractive and repulsive petals is constructed,…
The graph is one of the most widely used mathematical structures in engineering and science because of its representational power and inherent ability to demonstrate the relationship between objects. The objective of this work is to…
In this article, we construct countably many mutually non-isotopic diffeomorphisms of some closed non simply-connected 4-manifolds that are homotopic to but not isotopic to the identity, by surgery along $\Theta$-graphs. As corollaries of…
In real-world systems, the relationships and connections between components are highly complex. Real systems are often described as networks, where nodes represent objects in the system and edges represent relationships or connections…
In this paper we introduce the concept of characteristic number that are proven to be useful in the study of the combinatorics of graph cohomology. We claim that it is a good combinatorial counterpart for geometric Betti numbers. We then…
The classical Hausdorff dimension of finite or countable metric spaces is zero. Recently, we defined a variant, called \emph{finite Hausdorff dimension}, which is not necessarily trivial on finite metric spaces. In this paper we apply this…
Chart descriptions are a graphic method to describe monodromy representations of various topological objects. Here we introduce a chart description for genus-two Lefschetz fibrations, and show that any genus-two Lefschetz fibration can be…
In this paper, we define the non-commuting graph associated to a Lie algebra L and obtain some basic graph properties such as connectivity, diameter, girth, Hamiltonian and Eulerian. Moreover, planarity, outer planarity and isomorphism…
We prove two general decomposition theorems for fixed-point invariants: one for the Lefschetz number and one for the Reidemeister trace. These theorems imply the familiar additivity results for these invariants. Moreover, the proofs of…
A point x is a (bow) tie-point of a space X if X setminus {x} can be partitioned into (relatively) clopen sets each with x in its closure. Tie-points have appeared in the construction of non-trivial autohomeomorphisms of betaN setminus N=…
The Nielsen Conjecture for Homeomorphisms asserts that any homeomorphism $f$ of a closed manifold is isotopic to a map realizing the Nielsen number of $f$, which is a lower bound for the number of fixed points among all maps homotopic to…
Connection matrices were introduced by Freedman, Lovasz and Schrijver [1], who used them to characterize graph homomorphism functions. The goal of this note is to determine the exact rank of these matrices. The result can be rephrased in…
This article investigates the isomorphism problem for graphs derived from the four standard graph products: Cartesian, Kronecker (direct), strong, and lexicographic product. We provide a complete characterization of all simple connected…
We define boundedness properties on the contractible fixed points set of the time-one map of an identity isotopy on a closed oriented surface with genus $g\geq1$. In symplectic geometry, a classical object is the notion of action function,…
A topological space has the fixed point property if every continuous self-map of that space has at least one fixed point. We demonstrate that there are serious restraints imposed by the requirement that there be a choice of fixed points…
Persistent Homology is a powerful tool in Topological Data Analysis (TDA) to capture topological properties of data succinctly at different spatial resolutions. For graphical data, shape, and structure of the neighborhood of individual data…
In this paper, we discuss automorphism related parameters of a graph associated to a finite vector space. The fixing neighborhood of a pair $(u,v)$ of vertices of a graph $G$ is the set of all those vertices $w$ of $G$, such that the orbits…
We introduce and study elementary properties of graph homology of algebras. This new homology theory shares many features of cyclic and Hochschild homology. We also define a graph K-theory together with an analog of Chern character.
In this note, we derive a uniqueness theorem for minimal graphs of general codimension under certain restrictions closed related to the convexity (not strict convexity) of the area functional with respect to singular values, improving the…
We introduce graph motif parameters, a class of graph parameters that depend only on the frequencies of constant-size induced subgraphs. Classical works by Lov\'asz show that many interesting quantities have this form, including, for fixed…