Distinguishing infinite star-free graphs

IF 3.5 2区数学 Q1 MATHEMATICS, APPLIED

Applied Mathematics and Computation Pub Date : 2025-01-23 DOI:10.1016/j.amc.2025.129310

Marcin Stawiski

{"title":"Distinguishing infinite star-free graphs","authors":"Marcin Stawiski","doi":"10.1016/j.amc.2025.129310","DOIUrl":null,"url":null,"abstract":"Call a vertex or an edge colouring of a graph <ce:italic>distinguishing</ce:italic>, if is not preserved by any non-identity automorphism. For a graph <ce:italic>H</ce:italic>, we say that a graph <ce:italic>G</ce:italic> is <ce:italic>H-free</ce:italic> if there is no induced subgraph of <ce:italic>G</ce:italic>, which is isomorphic to <ce:italic>H</ce:italic>. Gorzkowska, Kargul, Musiał and Pal proved that for every natural number <ce:italic>n</ce:italic> greater than 2 each finite connected <mml:math altimg=\"si1.svg\"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math>-free graph on at least six vertices has a distinguishing edge colouring using at most <mml:math altimg=\"si2.svg\"><mml:mi>n</mml:mi><mml:mo linebreak=\"goodbreak\" linebreakstyle=\"after\">−</mml:mo><mml:mn>1</mml:mn></mml:math> colours. We extend this result to all locally finite connected <mml:math altimg=\"si1.svg\"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math>-free graphs on at least six vertices.","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"10 1","pages":""},"PeriodicalIF":3.5000,"publicationDate":"2025-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Mathematics and Computation","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1016/j.amc.2025.129310","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}

引用次数: 0

Abstract

Call a vertex or an edge colouring of a graph distinguishing, if is not preserved by any non-identity automorphism. For a graph H, we say that a graph G is H-free if there is no induced subgraph of G, which is isomorphic to H. Gorzkowska, Kargul, Musiał and Pal proved that for every natural number n greater than 2 each finite connected K1,n-free graph on at least six vertices has a distinguishing edge colouring using at most n−1 colours. We extend this result to all locally finite connected K1,n-free graphs on at least six vertices.

查看原文本刊更多论文

求助全文

约1分钟内获得全文求助全文

来源期刊

Applied Mathematics and Computation 数学-应用数学

CiteScore

7.90

自引率

10.00%

发文量

755

审稿时长

36 days

期刊介绍： Applied Mathematics and Computation addresses work at the interface between applied mathematics, numerical computation, and applications of systems – oriented ideas to the physical, biological, social, and behavioral sciences, and emphasizes papers of a computational nature focusing on new algorithms, their analysis and numerical results. In addition to presenting research papers, Applied Mathematics and Computation publishes review articles and single–topics issues.