An introduction to the deduction number

IF 1 3区 数学 Q3 MATHEMATICS, APPLIED Discrete Applied Mathematics Pub Date : 2025-07-15 Epub Date: 2025-03-07 DOI:10.1016/j.dam.2025.02.024
Andrea Burgess , Danny Dyer , Mozhgan Farahani
{"title":"An introduction to the deduction number","authors":"Andrea Burgess ,&nbsp;Danny Dyer ,&nbsp;Mozhgan Farahani","doi":"10.1016/j.dam.2025.02.024","DOIUrl":null,"url":null,"abstract":"<div><div>The deduction game is a variation of the game of cops and robber on graphs in which searchers must capture an invisible evader in at most one move. Searchers know each others’ initial locations, but can only communicate if they are on the same vertex. Thus, searchers must deduce other searchers’ movement and move accordingly. We introduce the deduction number and study it for various classes of graphs. We provide upper bounds for the deduction number of the Cartesian product of graphs.</div></div>","PeriodicalId":50573,"journal":{"name":"Discrete Applied Mathematics","volume":"369 ","pages":"Pages 20-27"},"PeriodicalIF":1.0000,"publicationDate":"2025-07-15","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/S0166218X25000940","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/3/7 0:00:00","PubModel":"Epub","JCR":"Q3","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

The deduction game is a variation of the game of cops and robber on graphs in which searchers must capture an invisible evader in at most one move. Searchers know each others’ initial locations, but can only communicate if they are on the same vertex. Thus, searchers must deduce other searchers’ movement and move accordingly. We introduce the deduction number and study it for various classes of graphs. We provide upper bounds for the deduction number of the Cartesian product of graphs.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
扣除额的介绍
推理游戏是警察和强盗游戏的一种变体,搜索者必须在最多一次移动中抓住一个看不见的逃避者。搜索者知道彼此的初始位置,但只有当他们在同一顶点时才能通信。因此,搜索者必须推断出其他搜索者的移动,并相应地移动。介绍了各种图的演绎数,并对其进行了研究。给出了图的笛卡尔积的演绎数的上界。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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.
期刊最新文献
Order and chain polytopes of maximal ranked posets A note on distance-hereditary graphs whose complement is also distance-hereditary The 3-restricted edge-connectivity of the direct product graphs A polyhedral study of a relaxation of the routing and spectrum allocation problem On sufficient degree conditions for a graph to be disjoint path coverable
×
引用
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