Finite Cartesian Product is a mathematical operation that, given a finite collection of sets, forms a set of all possible ordered tuples where each element of a tuple is drawn from the corresponding set in the collection.
146
Publications
3.9K
Citations
256
Authors
159
Institutions
Publications per year
2017–2026
13
Parents
Publications
146
Domains and Their Cartesian Products
Andrzej Trybulec · 1990 · 218 citations
E. G. Begle · Annals of Mathematics · 1950 · 97 citations
Dominating Cartesian products of cycles
Sandi Klavžar, Norbert Seifter · Discrete Applied Mathematics · 1995 · 85 citations
1–5 of 146
Authors
256
- OE
3
h-index
- JS
3
h-index
- WI
3
h-index
- MS
3
h-index
- PC
3
h-index
1–5 of 256
Institutions
159
University of Maribor
Maribor, Slovenia
6 h-index
9 publications
268 citations
Montanuniversität Leoben
Leoben, Austria
4 h-index
4 publications
175 citations
AT&T (United States)
Bedminster, United States
3 h-index
5 publications
122 citations
Institute of Mathematics, Physics, and Mechanics
Ljubljana, Slovenia
3 h-index
4 publications
185 citations
Indian Institute of Science Bangalore
Bengaluru, India
2 h-index
3 publications
94 citations
Clarkson University
Potsdam, United States
2 h-index
7 publications
333 citations
Universidad Autónoma de Guerrero
Chilpancingo, Mexico
2 h-index
3 publications
52 citations
Sobolev Institute of Mathematics
Novosibirsk, Russia
2 h-index
3 publications
36 citations
1–8 of 159
Venues
- Discrete Mathematics
8 publications · 126 citations
8
h-index
- The Electronic Journal of Combinatorics
6 publications · 189 citations
6
h-index
- Pacific Journal of Mathematics
5 publications · 154 citations
5
h-index
- Discrete Applied Mathematics
5 publications · 179 citations
5
h-index
- Mathematical Proceedings of the Cambridge Philosophical Society
4 publications · 75 citations
4
h-index
1–5