Results 1 to 10 of about 316,679 (279)
On invariant graph subspaces [PDF]
In this paper we discuss the problem of decomposition for unbounded $2\times 2$ operator matrices by a pair of complementary invariant graph subspaces.
Makarov, Konstantin A. +2 more
core +2 more sources
Convex Graph Invariant Relaxations For Graph Edit Distance [PDF]
The edit distance between two graphs is a widely used measure of similarity that evaluates the smallest number of vertex and edge deletions/insertions required to transform one graph to another.
Candogan, Utkan Onur +1 more
core +5 more sources
Edge Mostar Indices of Cacti Graph With Fixed Cycles
Topological invariants are the significant invariants that are used to study the physicochemical and thermodynamic characteristics of chemical compounds. Recently, a new bond additive invariant named the Mostar invariant has been introduced.
Farhana Yasmeen +3 more
doaj +1 more source
Duality of graph invariants [PDF]
We study a new set of duality relations between weighted, combinatoric invariants of a graph $G$. The dualities arise from a non-linear transform $\mathfrak{B}$, acting on the weight function $p$. We define $\mathfrak{B}$ on a space of real-valued functions $\mathcal{O}$ and investigate its properties.
Bu, Kaifeng, Gu, Weichen, Jaffe, Arthur
openaire +2 more sources
Three Constructions on Graphs and Distance-Based Invariants [PDF]
Many graphs are constructed from simpler ones by the use of operations on graphs, and as a consequence, the properties of the resulting constructions are strongly related to the properties of their constituents.
Mahdieh Azari
doaj +1 more source
Integrating simple genus two string invariants over moduli space
We consider an Sp(4, ℤ) invariant expression involving two factors of the Kawazumi-Zhang (KZ) invariant each of which is a modular graph with one link, and four derivatives on the moduli space of genus two Riemann surfaces.
Anirban Basu
doaj +1 more source
Summary: The eccentricity \(e(v)\) of a vertex \(v\) is defined as the distance to a farthest vertex from \(v\). The radius of a graph \(G\) is defined as \(r(G)=\min _{u \in V(G)}\{ e(u)\}\). A graph \(G\) is radius-edge-invariant if \(r(G-e)=r(G)\) for every \(e \in E(G)\), radius-vertex-invariant if \(r(G-v)= r(G)\) for every \(v \in V(G)\) and ...
Bálint, V., Vaček, O.
openaire +2 more sources
The uniqueness of DMAX-matrix graph invariants. [PDF]
In this paper, we examine the uniqueness (discrimination power) of a newly proposed graph invariant based on the matrix DMAX defined by Randić et al. In order to do so, we use exhaustively generated graphs instead of special graph classes such as trees ...
Matthias Dehmer, Yongtang Shi
doaj +1 more source
A Multiplicative Version of Forgotten Topological Index [PDF]
In this paper, we present upper bounds for the multiplicative forgotten topological index of several graph operations such as sum, Cartesian product, corona product, composition, strong product, disjunction and symmetric difference in terms of the F ...
Asghar Yousefi +3 more
doaj +1 more source
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper we study convex graph invariants, which are graph invariants that are convex functions of the adjacency matrix of a graph.
Chandrasekaran, Venkat +2 more
openaire +3 more sources

