Results 1 to 10 of about 61 (58)
Total Domination in Generalized Prisms and a New Domination Invariant
In this paper we complement recent studies on the total domination of prisms by considering generalized prisms, i.e., Cartesian products of an arbitrary graph and a complete graph.
Tepeh Aleksandra
doaj +1 more source
Masked Graph Convolutional Network for Small Sample Classification of Hyperspectral Images
The deep learning method has achieved great success in hyperspectral image classification, but the lack of labeled training samples still restricts the development and application of deep learning methods.
Wenkai Liu +5 more
doaj +1 more source
Graphs defined on groups [PDF]
This paper concerns aspects of various graphs whose vertex set is a group $G$ and whose edges reflect group structure in some way (so that, in particular, they are invariant under the action of the automorphism group of $G$).
Peter J. Cameron
doaj +1 more source
Topological structure of functions with isolated critical points on a 3-manifold
To each isolated critical point of a smooth function on a 3-manifold we put in correspondence a tree (graph without cycles). We will prove that functions are topologically equivalent in the neighbourhoods of critical points if and only if the ...
Bohdana Hladysh +2 more
doaj +1 more source
On 4-dimensional Einsteinian manifolds with parallel null distribution [PDF]
In this paper, we investigate the Einsteinian manifolds with parallel null distribution. For this purpose, we first obtain the equations, which are known as Einstein's equations, that lead to finding the mentioned manifolds and then, we reduce Einstein's
Mehdi Jafari
doaj +1 more source
Continuous Orbit Equivalence on Self-Similar Graph Actions
For self-similar graph actions, we show that isomorphic inverse semigroups associated to a self-similar graph action are a complete invariant for the continuous orbit equivalence of inverse semigroup actions on infinite path spaces.
Inhyeop Yi
doaj +1 more source
A polynomial invariant for a new class of phylogenetic networks.
Invariants for complicated objects such as those arising in phylogenetics, whether they are invariants as matrices, polynomials, or other mathematical structures, are important tools for distinguishing and working with such objects.
Joan Carles Pons +3 more
doaj +1 more source
Maximum Oriented Forcing Number for Complete Graphs
The \emph{maximum oriented $k$-forcing number} of a simple graph $G$, written $\MOF_k(G)$, is the maximum \emph{directed $k$-forcing number} among all orientations of $G$.
Yair Caro, Ryan Pepper
doaj +1 more source
ON ZAGREB ENERGIES OF SOME GRAPH OPERATIONS [PDF]
Recently, Zagreb energies, a graph invariant based on the eigenvalues of the Zagreb matrices have been proposed as an analogous to graph energy. In this communication, the Zagreb energies and Zagreb spectral radius are examined in relation to a number of
Idweep Gogoi +2 more
doaj +1 more source
Connection Number- Based Topological Indices of Cartesian Product of Graphs
The area of graph theory (GT) is rapidly expanding and playing a significant role in cheminformatics, mostly in mathematics and chemistry to develop different physicochemical, chemical structure, and their properties.
Aiman Arshad +3 more
doaj +1 more source

