✨
Yapay Zeka Hızlı Bakış & Çıkarımlar
AI Insight⚡ TL;DR(1 Cümlede Hızlı Çıkarım)
We also state some open problems about Ferrer-Esque graphs to the readers.
📌 3 Maddede Bu Makale
🎯
Amaç & Hipotez: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.
📊
Temel Bulgular & Veri:The minimal constructions provide to obtain a Ferrer-esque graph by adding minimum number of edges to paths and cycles.
💡
Sonuç & Katkı:We also state some open problems about Ferrer-Esque graphs to the readers.
🔬Tür:Araştırma Makalesi
📍Kapsam:Genişletilmiş Akademik Örneklem
⚙️Değişkenler: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.
Anahtar kelimeler
🔖
Bu Makaleye Atıf Yap
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