1 Ocak 2022 Dergi makalesi Açık Erişim

Buyukcolak, Yasemin; Ozkan, Sibel; Gozupek, Didem

JSON-LD (schema.org)

{
  "@context": "https://schema.org/", 
  "@id": 236434, 
  "@type": "ScholarlyArticle", 
  "creator": [
    {
      "@type": "Person", 
      "affiliation": "Gebze Tech Univ, Dept Math, TR-41400 Kocaeli, Turkey", 
      "name": "Buyukcolak, Yasemin"
    }, 
    {
      "@type": "Person", 
      "affiliation": "Gebze Tech Univ, Dept Math, TR-41400 Kocaeli, Turkey", 
      "name": "Ozkan, Sibel"
    }, 
    {
      "@type": "Person", 
      "affiliation": "Gebze Tech Univ, Dept Comp Engn, Kocaeli, Turkey", 
      "name": "Gozupek, Didem"
    }
  ], 
  "datePublished": "2022-01-01", 
  "description": "A graph is called equimatchable if all of its maximal matchings have the same size. Frendrup et al. provided a characterization of equimatchable graphs with girth at least 5. In this paper, we extend this result by providing a complete structural characterization of equimatchable graphs with girth at least 4, that is, equimatchable graphs with no triangle, by identifying the equimatchable triangle-free graph families. Our characterization also extends the result given by Akbari et al., which proves that the only connected triangle-free equimatchable r-regular graphs are C 5, C 7, and K r , r, where r is a positive integer. Given a nonbipartite graph, our characterization implies a linear time recognition algorithm for triangle-free equimatchable graphs.", 
  "headline": "Triangle-free equimatchable graphs", 
  "identifier": 236434, 
  "image": "https://aperta.ulakbim.gov.tr/static/img/logo/aperta_logo_with_icon.svg", 
  "license": "http://www.opendefinition.org/licenses/cc-by", 
  "name": "Triangle-free equimatchable graphs", 
  "url": "https://aperta.ulakbim.gov.tr/record/236434"
}