Results 31 to 40 of about 232,590 (215)
On Products and Line Graphs of Signed Graphs, their Eigenvalues and Energy [PDF]
, 2010 In this article we examine the adjacency and Laplacian matrices and their eigenvalues and energies of the general product (non-complete extended $p$-sum, or NEPS) of signed graphs.
Germina, K. A. +2 more
core +3 more sources
Convex polygons in cartesian products
Journal of Computational Geometry, 2018 We study several problems concerning convex polygons whose vertices lie in a Cartesian product of two sets of $n$ real numbers (for short, \emph{grid}). First, we prove that every such grid contains $\Omega(\log n)$ points in convex position and that this bound is tight up to a constant factor.
Claire Pennarun +7 more
openaire +8 more sources
On Power Graph of Some Finite Rings [PDF]
Mathematics Interdisciplinary Research, 2023 Consider a ring $R$ with order $p$ or $p^2$, and let $\mathcal{P}(R)$ represent its multiplicative power graph. For two distinct rings $R_1$ and $R_2$ that possess identity element 1, we define a new structure called the unit semi-cartesian ...
Masoumeh Soleimani, Mohamad Hasan Naderi
doaj +1 more source
On the hamiltonicity of the cartesian product
Information Processing Letters, 2005 We examine the hamiltonicity of the cartesian product P = G1×G2 of two graphs G1, G2. We provide necessary and/or sufficient conditions for P to be hamiltonian, depending on the hamiltonian properties of G1 and G2, with corresponding constructions. We also prove a conjecture by Batagelj and Pisanski related to the 'cyclic hamiltonicity' of a graph.
Dimakopoulos, V. V. +2 more
openaire +2 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 +2 more sources
On very strongly perfect Cartesian product graphs
AIMS Mathematics, 2022 Let $ G_1 \square G_2 $ be the Cartesian product of simple, connected and finite graphs $ G_1 $ and $ G_2 $. We give necessary and sufficient conditions for the Cartesian product of graphs to be very strongly perfect.
Ganesh Gandal +2 more
doaj +1 more source
Using Cartesian product for animation [PDF]
The Journal of Visualization and Computer Animation, 2001 AbstractIn the field of geometric modelling for animation, 4D modelling (time being the fourth dimension) seems to be a natural extension of 3D modelling. But time dimension is not easy to apprehend and 4D objects are difficult to interpret and to control in general.
Xavier Skapin, Pascal Lienhardt
openalex +2 more sources
Hamilton-connected properties in cartesian product [PDF]
Transactions on Combinatorics, 2012 In this paper, we investigate a problem of finding natural condition to assure the product of two graphs to be hamilton-connected. We present some sufficient and necessary conditions for $GBox H$ being hamilton-connected when $G$ is a hamilton-connected ...
Rushengul Hoshur, Elkin Vumar
doaj
Neutrosophic Hyperideals of Semihyperrings [PDF]
Neutrosophic Sets and Systems, 2016 In this paper, we have introduced neutrosophic hyperideals of a semihyperring and considered some operations on them to study its basic notions and properties.
Debabrata Mandal
doaj
New Results on the Aggregation of Norms
Mathematics, 2021 It is a natural question if a Cartesian product of objects produces an object of the same type. For example, it is well known that a countable Cartesian product of metrizable topological spaces is metrizable.
Tatiana Pedraza +1 more
doaj +1 more source