Selcuk TOPAL

110140

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

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

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.,

___

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

Communication in Mathematical Modeling and Applications-Cover

Başlangıç: 2016
Yayıncı: Mustafa BAYRAM

Arşiv

Sayıdaki Diğer Makaleler

Characterizations of Spacelike Curves according to Bishop Darboux Vector in Minkowski 3-Space E₁³

Huseyin Kocayigit, Bahattin BUKCU, İlker PEKTAS

Insurance in Turkey and main problems of the sector

Alaattin FİRAT

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

Investigation of non-lightlike tubular surfaces with Darboux frame in Minkowski 3-space

Emad Mohammed SOLOUMA

Brand gender, brand personality and brand loyalty relationship