Research Article
BibTex RIS Cite

Finding minimal Ferrers-esque graphs on path graphs ans cycle graphs via set cover

Year 2016, Volume: 1 Issue: 2, 42 - 49, 01.06.2016

Selcuk Topal

Abstract

This paper presents minimal construction techniques of a new graph class called Ferrer-esque [10] comes from Ferrers
relation [9] on path and cycle graphs by using set cover method. The minimal constructions provide to obtain a Ferrer-esque graph by
adding minimum number of edges to paths and cycles. We also state some open problems about Ferrer-Esque graphs to the readers.

Keywords

Graph algorithms factorization matching partitioning covering and packing Paths and cycles.

References

  • Andrews, G. E., The Theory of Partitions, Cambridge, England: Cambridge University Press, pp. 6-7, 1998.

Year 2016, Volume: 1 Issue: 2, 42 - 49, 01.06.2016

Selcuk Topal

Abstract

References

  • Andrews, G. E., The Theory of Partitions, Cambridge, England: Cambridge University Press, pp. 6-7, 1998.
There are 1 citations in total.

Details

Subjects Mathematical Sciences
Journal Section Mathematics, Engineering and statistics
Authors

Selcuk Topal

Publication Date June 1, 2016
Published in Issue Year 2016 Volume: 1 Issue: 2

Cite

APA Topal, S. (2016). Finding minimal Ferrers-esque graphs on path graphs ans cycle graphs via set cover. Communication in Mathematical Modeling and Applications, 1(2), 42-49.
AMA Topal S. Finding minimal Ferrers-esque graphs on path graphs ans cycle graphs via set cover. CMMA. June 2016;1(2):42-49.
Chicago Topal, Selcuk. “Finding Minimal Ferrers-Esque Graphs on Path Graphs Ans Cycle Graphs via Set Cover”. Communication in Mathematical Modeling and Applications 1, no. 2 (June 2016): 42-49.
EndNote Topal S (June 1, 2016) Finding minimal Ferrers-esque graphs on path graphs ans cycle graphs via set cover. Communication in Mathematical Modeling and Applications 1 2 42–49.
IEEE S. Topal, “Finding minimal Ferrers-esque graphs on path graphs ans cycle graphs via set cover”, CMMA, vol. 1, no. 2, pp. 42–49, 2016.
ISNAD Topal, Selcuk. “Finding Minimal Ferrers-Esque Graphs on Path Graphs Ans Cycle Graphs via Set Cover”. Communication in Mathematical Modeling and Applications 1/2 (June 2016), 42-49.
JAMA Topal S. Finding minimal Ferrers-esque graphs on path graphs ans cycle graphs via set cover. CMMA. 2016;1:42–49.
MLA Topal, Selcuk. “Finding Minimal Ferrers-Esque Graphs on Path Graphs Ans Cycle Graphs via Set Cover”. Communication in Mathematical Modeling and Applications, vol. 1, no. 2, 2016, pp. 42-49.
Vancouver Topal S. Finding minimal Ferrers-esque graphs on path graphs ans cycle graphs via set cover. CMMA. 2016;1(2):42-9.