Results 1  10
of
1,484
On Subgraphs of Cartesian Product Graphs
 Discrete Math
, 1999
"... Graphs which can be represented as nontrivial subgraphs of Cartesian product ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
Graphs which can be represented as nontrivial subgraphs of Cartesian product
Metrics in Cartesian Product 1
"... Summary. A continuation of paper [6]. It deals with the method of creation of the distance in the Cartesian product of metric spaces. The distance of two points belonging to Cartesian product of metric spaces has been defined as sum of distances of appropriate coordinates (or projections) of these p ..."
Abstract
 Add to MetaCart
Summary. A continuation of paper [6]. It deals with the method of creation of the distance in the Cartesian product of metric spaces. The distance of two points belonging to Cartesian product of metric spaces has been defined as sum of distances of appropriate coordinates (or projections
Metrics in Cartesian Product 1
"... Summary. A continuation of the paper [8]. It deals with the method of creation of the distance in the Cartesian product of metric spaces. The distance of two points belonging to the Cartesian product of metric spaces has been defined as the sum of distances of appriopriate coordinates (or projection ..."
Abstract
 Add to MetaCart
Summary. A continuation of the paper [8]. It deals with the method of creation of the distance in the Cartesian product of metric spaces. The distance of two points belonging to the Cartesian product of metric spaces has been defined as the sum of distances of appriopriate coordinates (or
Bipanconnectivity of Cartesian product networks
 AUSTRALASIAN JOURNAL OF COMBINATORICS VOLUME 46 (2010), PAGES 297–306
, 2010
"... This paper is concerned with the bipanconnectivity of Cartesian product networks. It provides sufficient conditions for a Cartesian product network to be bipanconnected and uses this general result to reprove existing results as regards the kary ncube, due to Stewart and Xiang and to Hsieh and Li ..."
Abstract
 Add to MetaCart
This paper is concerned with the bipanconnectivity of Cartesian product networks. It provides sufficient conditions for a Cartesian product network to be bipanconnected and uses this general result to reprove existing results as regards the kary ncube, due to Stewart and Xiang and to Hsieh
On the Weak Reconstruction of CartesianProduct Graphs
, 1996
"... In this paper we reconstruct nontrivial connected Cartesian product ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
In this paper we reconstruct nontrivial connected Cartesian product
Connectivity of Cartesian products of graphs
 APPL. MATH. LETT
"... A short proof for the closed expression of the edgeconnectivity of Cartesian product graphs is given and the structure of minimum edge cuts is described. It is also proved that the connectivity and edgeconnectivity of an arbitrary Cartesian power equals its minimum degree. ..."
Abstract
 Add to MetaCart
A short proof for the closed expression of the edgeconnectivity of Cartesian product graphs is given and the structure of minimum edge cuts is described. It is also proved that the connectivity and edgeconnectivity of an arbitrary Cartesian power equals its minimum degree.
Cartesian products as profinite completions
 International Math. Research Notices 2006 (2006), Article ID 72947
"... We prove that if a Cartesian product of alternating groups is topologically finitely generated, then it is the profinite completion of a finitely generated residually finite group. The same holds for Cartesian producs of other simple groups under some natural restrictions. 1 ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
We prove that if a Cartesian product of alternating groups is topologically finitely generated, then it is the profinite completion of a finitely generated residually finite group. The same holds for Cartesian producs of other simple groups under some natural restrictions. 1
Cartesian product of multivalued operators
"... The purpose of this paper is to show that, using the cartesian product of multivalued operators, one can obtain several results, old and new, from different topics (best approximation, coincidence point and fixed point theory) in nonlinear analysis. ..."
Abstract
 Add to MetaCart
The purpose of this paper is to show that, using the cartesian product of multivalued operators, one can obtain several results, old and new, from different topics (best approximation, coincidence point and fixed point theory) in nonlinear analysis.
Connectivity of Cartesian product graphs
, 2006
"... Use vi, �i, �i, �i to denote order, connectivity, edgeconnectivity and minimum degree of a graph Gi for i =1, 2, respectively. For the connectivity and the edgeconnectivity of the Cartesian product graph, up to now, the best results are �(G1 × G2)��1 + �2 and �(G1 × G2)��1 + �2. This paper improve ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
Use vi, �i, �i, �i to denote order, connectivity, edgeconnectivity and minimum degree of a graph Gi for i =1, 2, respectively. For the connectivity and the edgeconnectivity of the Cartesian product graph, up to now, the best results are �(G1 × G2)��1 + �2 and �(G1 × G2)��1 + �2. This paper
Measurements of interdependence in fractional Cartesian products
, 2003
"... The notion of a fractional Cartesian product and a subsequent notion of combinatorial ..."
Abstract
 Add to MetaCart
The notion of a fractional Cartesian product and a subsequent notion of combinatorial
Results 1  10
of
1,484