Results 1 to 10 of about 5,146,733 (247)
The Cartesian Product and Join Graphs on Edge-Version Atom-Bond Connectivity and Geometric Arithmetic Indices [PDF]
The Cartesian product and join are two classical operations in graphs. Let dL(G)(e) be the degree of a vertex e in line graph L(G) of a graph G. The edge versions of atom-bond connectivity (ABCe) and geometric arithmetic (GAe) indices of G are defined as
Xiujun Zhang, Huiqin Jiang, Jia-Bao Liu
exaly +3 more sources
Additive Decoders for Latent Variables Identification and Cartesian-Product Extrapolation [PDF]
We tackle the problems of latent variables identification and ``out-of-support'' image generation in representation learning. We show that both are possible for a class of decoders that we call additive, which are reminiscent of decoders used for object ...
Sébastien Lachapelle +3 more
openalex +3 more sources
The Diagnosability of the Generalized Cartesian Product of Networks
Motivated by two typical ways to construct multiprocessor systems, matching composition networks and cycle composition networks, we generalize the definition of the Cartesian product of networks and consider the classical diagnosability of the ...
Meirun Chen, Cheng-Kuan Lin
doaj +2 more sources
On the bounds of degree-based topological indices of the Cartesian product of F-sum of connected graphs. [PDF]
Topological indices are the mathematical tools that correlate the chemical structure with various physical properties, chemical reactivity or biological activity numerically.
Imran M +3 more
europepmc +2 more sources
On the power domination number of the Cartesian product of graphs
We give a brief survey about the existing results on the power domination of the Cartesian product of graphs, and improve two of the results by determining the exact power domination numbers of two families of graphs, namely, the cylinder Pn□Cmand the ...
K.M. Koh, K.W. Soh
doaj +3 more sources
Turing instabilities on Cartesian product networks. [PDF]
The problem of Turing instabilities for a reaction-diffusion system defined on a complex Cartesian product network is considered. To this end we operate in the linear regime and expand the time dependent perturbation on a basis formed by the tensor ...
Asllani M +4 more
europepmc +3 more sources
Completeness of the Cartesian Product of Two Complete Fuzzy Normed Spaces [PDF]
In this paper it was proved that the Cartesian product of two fuzzy normed spaces is a fuzzy normed space then it was proved that the Cartesian product of two complete fuzzy normed spaces is again a complete fuzzy normed space.
Jehad R. Kider
doaj +2 more sources
Edge-Transitive Lexicographic and Cartesian Products
In this note connected, edge-transitive lexicographic and Cartesian products are characterized. For the lexicographic product G ◦ H of a connected graph G that is not complete by a graph H, we show that it is edge-transitive if and only if G is edge ...
Imrich Wilfried +3 more
doaj +4 more sources
Power domination of the cartesian product of graphs
In this paper, we first give a brief survey on the power domination of the Cartesian product of graphs. Then we conjecture a Vizing-like inequality for the power domination problem, and prove that the inequality holds when at least one of the two graphs ...
K.M. Koh, K.W. Soh
doaj +2 more sources
Distance magic Cartesian product of graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sylwia Cichacz +3 more
openalex +4 more sources

