Well-indumatched Pseudoforests

IF 1 3区 数学 Q3 MATHEMATICS, APPLIED Discrete Applied Mathematics Pub Date : 2025-01-30 Epub Date: 2024-09-30 DOI:10.1016/j.dam.2024.09.018
Yasemin Büyükçolak , Didem Gözüpek , Sibel Özkan
{"title":"Well-indumatched Pseudoforests","authors":"Yasemin Büyükçolak ,&nbsp;Didem Gözüpek ,&nbsp;Sibel Özkan","doi":"10.1016/j.dam.2024.09.018","DOIUrl":null,"url":null,"abstract":"<div><div>A graph is called well-indumatched if all of its maximal induced matchings have the same size. Akbari et al. (0000) provided a characterization of well-indumatched trees and some results on well-indumatched unicyclic graphs. In this paper, we extend this result by providing a complete structural characterization of well-indumatched pseudotrees, in which each component has no cycle or a unique cycle, by identifying the well-indumatched graph families.</div></div>","PeriodicalId":50573,"journal":{"name":"Discrete Applied Mathematics","volume":"361 ","pages":"Pages 85-102"},"PeriodicalIF":1.0000,"publicationDate":"2025-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Applied Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0166218X24004086","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2024/9/30 0:00:00","PubModel":"Epub","JCR":"Q3","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

A graph is called well-indumatched if all of its maximal induced matchings have the same size. Akbari et al. (0000) provided a characterization of well-indumatched trees and some results on well-indumatched unicyclic graphs. In this paper, we extend this result by providing a complete structural characterization of well-indumatched pseudotrees, in which each component has no cycle or a unique cycle, by identifying the well-indumatched graph families.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
不匹配的伪森林
如果一个图的所有最大诱导匹配都具有相同的大小,那么这个图就被称为wellindumatched。Akbari 等人(0000 年)提供了良好不匹配树的表征,以及一些关于良好不匹配单环图的结果。在本文中,我们对这一结果进行了扩展,通过确定良好不匹配图族,提供了良好不匹配伪树的完整结构特征,其中每个分量都没有循环或唯一循环。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Discrete Applied Mathematics
Discrete Applied Mathematics 数学-应用数学
CiteScore
2.30
自引率
9.10%
发文量
422
审稿时长
4.5 months
期刊介绍: The aim of Discrete Applied Mathematics is to bring together research papers in different areas of algorithmic and applicable discrete mathematics as well as applications of combinatorial mathematics to informatics and various areas of science and technology. Contributions presented to the journal can be research papers, short notes, surveys, and possibly research problems. The "Communications" section will be devoted to the fastest possible publication of recent research results that are checked and recommended for publication by a member of the Editorial Board. The journal will also publish a limited number of book announcements as well as proceedings of conferences. These proceedings will be fully refereed and adhere to the normal standards of the journal. Potential authors are advised to view the journal and the open calls-for-papers of special issues before submitting their manuscripts. Only high-quality, original work that is within the scope of the journal or the targeted special issue will be considered.
期刊最新文献
Extremal digraphs containing at most t paths of length 2 with the same endpoints On the (1,1,2,3)-packing coloring of some subcubic graphs On the positive and negative p-energies of graphs under edge addition Note on the spectra of signed complete bipartite graphs with regular negative edges Turán numbers of cycles plus a general graph
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1