Perfect sets of independent functions
Wojciech Dębski, Jan Kleszcz, Szymon Plewik (1992)
Acta Universitatis Carolinae. Mathematica et Physica
Similarity:
Displaying similar documents to “Perfect dominating sets in the Cartesian products of prime cycles.”
Perfect sets of independent functions
Perfect codes in Cartesian products of 2-paths and infinite paths.
Dorbec, Paul, Mollard, Michel (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
An analogue in certain unique factorization domains of the Euclid-Euler theorem on perfect numbers.
McDaniel, Wayne L. (1990)
International Journal of Mathematics and Mathematical Sciences
Similarity:
A Property Of The Number Of Perfect Matchings Of A Graph
Ivan Gutman (1991)
Publications de l'Institut Mathématique
Similarity:
Bounds on the Turán density of PG(3, 2).
Cioabă, Sebastian M. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On near-perfect and deficient-perfect numbers
Min Tang, Xiao-Zhi Ren, Meng Li (2013)
Colloquium Mathematicae
Similarity:
For a positive integer n, let σ(n) denote the sum of the positive divisors of n. Let d be a proper divisor of n. We call n a near-perfect number if σ(n) = 2n + d, and a deficient-perfect number if σ(n) = 2n - d. We show that there is no odd near-perfect number with three distinct prime divisors and determine all deficient-perfect numbers with at most two distinct prime factors.
Thirty-nine perfect numbers and their divisors.
Asadulla, Syed (1986)
International Journal of Mathematics and Mathematical Sciences
Similarity:
A note on pm-compact bipartite graphs
Jinfeng Liu, Xiumei Wang (2014)
Discussiones Mathematicae Graph Theory
Similarity:
A graph is called perfect matching compact (briefly, PM-compact), if its perfect matching graph is complete. Matching-covered PM-compact bipartite graphs have been characterized. In this paper, we show that any PM-compact bipartite graph G with δ (G) ≥ 2 has an ear decomposition such that each graph in the decomposition sequence is also PM-compact, which implies that G is matching-covered
An upper bound for odd perfect numbers.
Nielsen, Pace P. (2003)
Integers
Similarity:
A note on divisibility of the number of matchings of a family of graphs.
Hwang, Kyung-Won, Sheikh, Naeem N., Hartke, Stephen G. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Sylvester: ushering in the modern era of research on odd perfect numbers.
Gimbel, Steven, Jaroma, John H. (2003)
Integers
Similarity:
On a sum of divisors problem.
De Koninck, Jean-Marie, Ivić, Aleksandar (1998)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity: