Results 61 to 70 of about 232,590 (215)
An improvement in the two-packing bound related to Vizing's conjecture
Theory and Applications of Graphs, 2020 Vizing's conjecture states that the domination number of the Cartesian product of graphs is at least the product of the domination numbers of the two factor graphs.
Kimber Wolff
doaj +1 more source
Quality-based generation of weather radar Cartesian products [PDF]
Atmospheric Measurement Techniques, 2015 Weather radar data volumes are commonly processed to obtain various 2-D Cartesian products based on the transfer from polar to Cartesian representations through a certain interpolation method. In this research an algorithm of the spatial interpolation of
K. Ośródka, J. Szturc
doaj +1 more source
The exponent of Cartesian product of cycles
Applied Mathematics Letters, 2009 AbstractA digraph D is primitive if for each pair of vertices v,w of D, there is a positive integer k such that there is a directed walk of length k from v to w. The minimum of such k is the exponent of D. In this paper, we show that for a primitive graph G and a strongly connected bipartite digraph D, the exponent of the Cartesian product G×D is equal
Woonjae Hwang +2 more
openaire +2 more sources
Fast Recognition of Partial Star Products and Quasi Cartesian Products [PDF]
, 2013 This paper is concerned with the fast computation of a relation $\R$ on the edge set of connected graphs that plays a decisive role in the recognition of approximate Cartesian products, the weak reconstruction of Cartesian products, and the recognition ...
Hellmuth, Marc +2 more
core +3 more sources
Prime Factorization And Domination In The Hierarchical Product Of Graphs
Discussiones Mathematicae Graph Theory, 2017 In 2009, Barrière, Dalfó, Fiol, and Mitjana introduced the generalized hierarchical product of graphs. This operation is a generalization of the Cartesian product of graphs.
Anderson S.E. +3 more
doaj +1 more source
Hypo-q-Norms on a Cartesian Product of Algebras of Operators on Banach Spaces
Annales Mathematicae Silesianae, 2020 In this paper we consider the hypo-q-operator norm and hypo-q-numerical radius on a Cartesian product of algebras of bounded linear operators on Banach spaces.
Dragomir Silvestru Sever
doaj +1 more source
GRACEFUL CHROMATIC NUMBER OF SOME CARTESIAN PRODUCT GRAPHS
Ural Mathematical Journal, 2023 A graph \(G(V,E)\) is a system consisting of a finite non empty set of vertices \(V(G)\) and a set of edges \(E(G)\). A (proper) vertex colouring of \(G\) is a function \(f:V(G)\rightarrow \{1,2,\ldots,k\},\) for some positive integer \(k\) such that ...
I Nengah Suparta +3 more
doaj +1 more source
On Linkedness of Cartesian Product of Graphs [PDF]
, 2014 We study linkedness of Cartesian product of graphs and prove that the product of an $a$-linked and a $b$-linked graphs is $(a+b-1)$-linked if the graphs are sufficiently large. Further bounds in terms of connectivity are shown. We determine linkedness of
Meszaros, Gabor
core
Asymptotics of the Euler number of bipartite graphs
, 2007 We define the Euler number of a bipartite graph on $n$ vertices to be the number of labelings of the vertices with $1,2,...,n$ such that the vertices alternate in being local maxima and local minima.
Ehrenborg +4 more
core +1 more source
Colouring the Square of the Cartesian Product of Trees
, 2010 We prove upper and lower bounds on the chromatic number of the square of the cartesian product of trees.
Wood, David R.
core +2 more sources