Journals / Communication in Mathematical Modeling and Applications / 2016 / Cilt: 1 Sayı: 2

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

Pages
42–49
Publication Date
2016-06-01
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

We also state some open problems about Ferrer-Esque graphs to the readers.

📌 3 Key Takeaways

🎯
Objective & Hypothesis: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.
📊
Key Findings & Data:The minimal constructions provide to obtain a Ferrer-esque graph by adding minimum number of edges to paths and cycles.
💡
Conclusion & Impact:We also state some open problems about Ferrer-Esque graphs to the readers.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Graph algorithms · factorization · matching

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.

🔖

Cite This Article

TOPAL, S. (2016). Finding minimal Ferrers-esque graphs on path graphs ans cycle graphs via set cover. Communication in Mathematical Modeling and Applications, Cilt: 1 Sayı: 2, 42–49. https://ajindex.com/articles/984313

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (1)

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