Results 1 to 10 of about 6,012,682 (310)
The Cartesian Product and Join Graphs on Edge-Version Atom-Bond Connectivity and Geometric Arithmetic Indices. [PDF]
Molecules, 2018 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
Zhang X, Jiang H, Liu JB, Shao Z.
europepmc +4 more sources
On the power domination number of the Cartesian product of graphs
AKCE International Journal of Graphs and Combinatorics, 2019 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]
Sci Rep, 2015 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
Cartesian product of hypergraphs: properties and algorithms [PDF]
Electronic Proceedings in Theoretical Computer Science, 2009 Cartesian products of graphs have been studied extensively since the 1960s. They make it possible to decrease the algorithmic complexity of problems by using the factorization of the product.
Alain Bretto +2 more
doaj +6 more sources
The generalized 3-connectivity of Cartesian product graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 Graph ...
Hengzhe Li, Xueliang Li, Yuefang Sun
doaj +6 more sources
Edge-Transitive Lexicographic and Cartesian Products
Discussiones Mathematicae Graph Theory, 2016 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
Additive Decoders for Latent Variables Identification and Cartesian-Product Extrapolation [PDF]
Neural Information Processing Systems, 2023 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
semanticscholar +1 more source
General Position Sets in Two Families of Cartesian Product Graphs
Mediterranean Journal of Mathematics, 2023 For a given graph G , the general position problem asks for the largest set of vertices $$S \subseteq V(G)$$ S ⊆ V ( G ) , such that no three distinct vertices of S belong to a common shortest path of G .
D. Korže, A. Vesel
semanticscholar +1 more source
THE GENERAL POSITION NUMBER OF THE CARTESIAN PRODUCT OF TWO TREES [PDF]
Bulletin of the Australian Mathematical Society, 2020 The general position number of a connected graph is the cardinality of a largest set of vertices such that no three pairwise-distinct vertices from the set lie on a common shortest path.
Jing Tian, Kexiang Xu, S. Klavžar
semanticscholar +1 more source
Axioms, 2022 We construct a countable algebraic basis of the algebra of all symmetric continuous polynomials on the Cartesian product ℓp1×…×ℓpn, where p1,…,pn∈[1,+∞), and ℓp is the complex Banach space of all p-power summable sequences of complex numbers for p∈[1,+∞).
Andriy Ivanovych Bandura +2 more
semanticscholar +1 more source