A Collection of Minimally Path Square-Saturated Graphs
DOI:
https://doi.org/10.15575/kubik.v5i1.8415Keywords:
power graphs, path square, saturated numbers, saturated graphs, degree sequence of graphAbstract
References
W. Mantel, "Problem 28," Wiskundige Opgaven, vol. 10, pp. 60-61, 1907.
P. Erdős and T. Gallai, "On the minimal number of vertices representing the edges of graph.," Magyar tud. Akad. Mat. Kutato Int. Kozl., vol. 6, pp. 181-203, 1961.
P. Erdős, A. Hajnal and J. W. Moon, "A problem in graph theory," Amer. Math. Monthly, vol. 71, pp. 1107-1110, 1964.
P. Turán, "Eine Extremalaufgabe aus der Graphentheorie," Mat. Fiz. Lapok, vol. 48, no. 1941, pp. 436-452, 1941.
Downloads
Published
How to Cite
Issue
Section
Citation Check
License
Authors who publish in KUBIK: Jurnal Publikasi Ilmiah Matematika agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Attribution-ShareAlike 4.0 International (CC BY-SA 4.0) License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
Â



