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

Show other versions (1)

This paper presents minimal construction techniques of a new graph class called Ferrer-esque comes from Ferrers relation \cite{Ferrer} 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 an...

Full description

Bibliographic Details
Main Author: Selçuk Topal
Format: Article
Language:English
Published: BİSKA Bilisim Company 2016-10-01
Series:Communication in Mathematical Modeling and Applications
Subjects:
Graph algorithms
factorization
matching
partitioning
covering and packing
paths and cycles
Online Access:http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=7199
id doaj-e93cd7f94a20433d812a6460f60d52a6
record_format Article
spelling doaj-e93cd7f94a20433d812a6460f60d52a62020-11-25T02:16:01ZengBİSKA Bilisim CompanyCommunication in Mathematical Modeling and Applications2528-830X2528-830X2016-10-011242497199Finding minimal Ferrers-esque graphs on path graphs ans cycle graphs via set coverSelçuk Topal0Selçuk Topal1Bitlis Eren University Department of Mathematics Bitlis Eren University Department of Mathematics This paper presents minimal construction techniques of a new graph class called Ferrer-esque comes from Ferrers relation \cite{Ferrer} 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.http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=7199Graph algorithmsfactorizationmatchingpartitioningcovering and packingpaths and cycles
collection DOAJ
language English
format Article
sources DOAJ
author Selçuk Topal
Selçuk Topal
spellingShingle Selçuk Topal
Selçuk Topal
Finding minimal Ferrers-esque graphs on path graphs ans cycle graphs via set cover
Communication in Mathematical Modeling and Applications
Graph algorithms
factorization
matching
partitioning
covering and packing
paths and cycles
author_facet Selçuk Topal
Selçuk Topal
author_sort Selçuk Topal
title Finding minimal Ferrers-esque graphs on path graphs ans cycle graphs via set cover
title_short Finding minimal Ferrers-esque graphs on path graphs ans cycle graphs via set cover
title_full Finding minimal Ferrers-esque graphs on path graphs ans cycle graphs via set cover
title_fullStr Finding minimal Ferrers-esque graphs on path graphs ans cycle graphs via set cover
title_full_unstemmed Finding minimal Ferrers-esque graphs on path graphs ans cycle graphs via set cover
title_sort finding minimal ferrers-esque graphs on path graphs ans cycle graphs via set cover
publisher BİSKA Bilisim Company
series Communication in Mathematical Modeling and Applications
issn 2528-830X
2528-830X
publishDate 2016-10-01
description This paper presents minimal construction techniques of a new graph class called Ferrer-esque comes from Ferrers relation \cite{Ferrer} 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.
topic Graph algorithms
factorization
matching
partitioning
covering and packing
paths and cycles
url http://www.ntmsci.com/ajaxtool/GetArticleByPublishedArticleId?PublishedArticleId=7199
work_keys_str_mv AT selcuktopal findingminimalferrersesquegraphsonpathgraphsanscyclegraphsviasetcover
AT selcuktopal findingminimalferrersesquegraphsonpathgraphsanscyclegraphsviasetcover
_version_ 1724893310617649152

Similar Items