Please use this identifier to cite or link to this item: https://scidar.kg.ac.rs/handle/123456789/11755
Full metadata record
DC FieldValueLanguage
dc.contributor.authorLi H.-
dc.contributor.authorWu Q.-
dc.contributor.authorGutman, Ivan-
dc.date.accessioned2021-04-20T19:09:00Z-
dc.date.available2021-04-20T19:09:00Z-
dc.date.issued2016-
dc.identifier.issn0096-3003-
dc.identifier.urihttps://scidar.kg.ac.rs/handle/123456789/11755-
dc.description.abstract© 2016 Elsevier Inc. All rights reserved. We consider an earlier much studied quasi-order, defined in terms of matching numbers of graphs, and apply it to graph complements. We establish four transformations on the complements of graphs that increase or decrease the matching numbers accordingly. Several applications of these results are put forward.-
dc.rightsrestrictedAccess-
dc.sourceApplied Mathematics and Computation-
dc.titleOn ordering of complements of graphs with respect to matching numbers-
dc.typearticle-
dc.identifier.doi10.1016/j.amc.2016.02.004-
dc.identifier.scopus2-s2.0-84959517367-
Appears in Collections:Faculty of Science, Kragujevac

Page views(s)

114

Downloads(s)

6

Files in This Item:
File Description SizeFormat 
PaperMissing.pdf
  Restricted Access
29.86 kBAdobe PDFThumbnail
View/Open


Items in SCIDAR are protected by copyright, with all rights reserved, unless otherwise indicated.