On irregularities in the graph of generalized divisor functions
Gergely Zábrádi (2003)
Acta Arithmetica
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Gergely Zábrádi (2003)
Acta Arithmetica
Similarity:
Don R. Lick (1976)
Colloquium Mathematicae
Similarity:
J. Nieminen (1975)
Applicationes Mathematicae
Similarity:
D. M. Cvetković (1975)
Matematički Vesnik
Similarity:
Dragoš M. Cvetković, Irena Pevac (1983)
Publications de l'Institut Mathématique
Similarity:
Marián Sudolský (1978)
Mathematica Slovaca
Similarity:
Aneta Dudek, A. Paweł Wojda (2004)
Discussiones Mathematicae Graph Theory
Similarity:
A graph G is said to be H-saturated if G is H-free i.e., (G has no subgraph isomorphic to H) and adding any new edge to G creates a copy of H in G. In 1986 L. Kászonyi and Zs. Tuza considered the following problem: for given m and n find the minimum size sat(n;Pₘ) of Pₘ-saturated graph of order n. They gave the number sat(n;Pₘ) for n big enough. We deal with similar problem for bipartite graphs.