Dergiler / 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

Sayfa
42–49
Yayın Tarihi
2016-06-01
DOI
—
🏛️Bu makalenin bibliyografik verileri ve tam metin bağlantısı DergiPark üzerinden sağlanmıştır.
DergiPark Kaydı ↗
✨

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.

🔖

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

📄 Tam Metin PDF Okuyucu

📄

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

Kaynakça (1)

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