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.
Displaying similar documents to “Characterizing which Powers of Hypercubes and Folded Hyper- cubes Are Divisor Graphs”
On irregularities in the graph of generalized divisor functions
The k-point-arboricity of a graph
Don R. Lick (1976)
Colloquium Mathematicae
Similarity:
Some applications of graph theory in the theory of hypergraphs
J. Nieminen (1975)
Applicationes Mathematicae
Similarity:
The determinant concept defined by means of graph theory
D. M. Cvetković (1975)
Matematički Vesnik
Similarity:
Discussing Graph Theory with a Computer III, Man-machine Theorem Proving
Dragoš M. Cvetković, Irena Pevac (1983)
Publications de l'Institut Mathématique
Similarity:
A generalization of the friendship theorem
Marián Sudolský (1978)
Mathematica Slovaca
Similarity:
Pₘ-saturated bipartite graphs with minimum size
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.