On Graphs and M-Equivalence
نویسندگان
چکیده
We present the isomorphic classification of free topological groups over spaces, which are geometric realizations finite graphs.
منابع مشابه
m-polar intuitionistic graphs and its properties
In many real world problems, data sometimes comes from n agents (n≥2), multipolar information exists. For issues that are associated with uncertainty, this information can not be showed with the values of crisp, fuzzy, intuitionistic or bipolar. Graph is one of the mathematical models widely used in different sciences. Ambiguity in a graph where data depends on the n parameter can not be showed...
متن کاملClassification of graphs based on homotopy equivalence. Homotopy equivalent graphs. Basic graphs and complexity of homotopy equivalence classes of graphs
The main concept of this classification is that graphs belonging to the same equivalence class have similar topological properties. Graphs are called homotopy equivalent if one of them can be converted to the other one by contractible transformations. A basic representative and complexity of a homotopy equivalence class are defined and investigated. Finding a basic representative within a homot...
متن کاملOn the M-polynomial of planar chemical graphs
Let $G$ be a graph and let $m_{i,j}(G)$, $i,jge 1$, be the number of edges $uv$ of $G$ such that ${d_v(G), d_u(G)} = {i,j}$. The $M$-polynomial of $G$ is $M(G;x,y) = sum_{ile j} m_{i,j}(G)x^iy^j$. With $M(G;x,y)$ in hands, numerous degree-based topological indices of $G$ can be routinely computed. In this note a formula for the $M$-polynomial of planar (chemical) graphs which have only vertices...
متن کاملOn $m$-Closed Graphs
A graph is closed when its vertices have a labeling by [n] such that the binomial edge ideal JG has a quadratic Gröbner basis with respect to the lexicographic order induced by x1 > · · · > xn > y1 > · · · > yn. In this paper, we generalize this notion and study the so called m-closed graphs. We find equivalent condition to 3-closed property of an arbitrary tree T . Using it, we classify a clas...
متن کاملDomination Equivalence in Graphs
A de-pair (ode-pair) in a graph consists of two disjoint subsets of vertices with the same closed neighborhood (open neighborhood). We consider the question of determining the smallest and largest subsets over all such pairs. We provide sharp bounds on these for general graphs and for trees, and show that the associated parameters are computable for trees but intractable in general.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Sciences
سال: 2023
ISSN: ['1072-3374', '1573-8795']
DOI: https://doi.org/10.1007/s10958-023-06555-2