Digital repository of Slovenian research organisations

Show document
A+ | A- | Help | SLO | ENG

Title:The conjecture on distance-balancedness of generalized Petersen graphs holds when internal edges have jumps $3$ or $4$
Authors:ID Ma, Gang (Author)
ID Wang, JianFeng (Author)
ID Klavžar, Sandi (Author)
Files:.pdf PDF - Presentation file, download (543,23 KB)
MD5: 6F281799BD158E2639752E01A1169815
 
URL URL - Source URL, visit https://inmabb.criba.edu.ar/revuma/revuma.php?p=doi/v68n2a18
 
Language:English
Typology:1.01 - Original Scientific Article
Organization:Logo IMFM - Institute of Mathematics, Physics, and Mechanics
Abstract:A connected graph $G$ with ${\rm diam}(G) \ge \ell$ is $\ell$-distance-balanced if $|W_{xy}|=|W_{yx}|$ for every $x,y\in V(G)$ with $d_{G}(x,y)=\ell$, where $W_{xy}$ is the set of vertices of $G$ that are closer to $x$ than to $y$. Miklavič and Šparl [Discrete Appl. Math. 244 (2018), 143--154] conjectured that if $n > n_k$ where where $n_k = 11$ if $k = 2$, $n_k = (k+1)^2$ if $k$ is odd, and $n_k = k(k +2)$ if $k \ge 4$ is even, then the generalized Petersen graph $GP(n,k)$ is not $\ell$-distance-balanced for any $1\le \ell<{\rm diam}(GP(n,k))$. In the seminal paper, the conjecture was verified for $k=2$. In this paper we prove that the conjecture holds for $k=3$ and for $k=4$.
Keywords:distance-balanced graph, $\ell$-distance-balanced graph, generalized Petersen graph, diameter
Publication status:Published
Publication version:Version of Record
Publication date:01.01.2025
Year of publishing:2025
Number of pages:str. 703-733
Numbering:Vol. 68, no. 2
PID:20.500.12556/DiRROS-24018 New window
UDC:519.17
ISSN on article:1669-9637
DOI:10.33044/revuma.4824 New window
COBISS.SI-ID:256284675 New window
Note:
Publication date in DiRROS:07.11.2025
Views:172
Downloads:90
Metadata:XML DC-XML DC-RDF
:
Copy citation
  
Share:Bookmark and Share


Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:Revista de la Unión Matemática Argentina
Shortened title:Rev. Unión Mat. Argent.
Publisher:Unión Matemática Argentina
ISSN:1669-9637
COBISS.SI-ID:524760345 New window

Document is financed by a project

Funder:Shandong Provincial Natural Science Foundation of China
Project number:ZR2022MA077

Funder:NSFC - National Natural Science Foundation of China
Project number:12371353

Funder:Special Fund for Taishan Scholars Project

Funder:IC Program of Shandong Institutions of Higher Learning for Youth Innovative Talents

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:P1-0297
Name:Teorija grafov

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:N1-0285
Name:Metrični problemi v grafih in hipergrafih

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:N1-0355
Name:Prirejanja, transverzale in hipergrafi

Licences

License:CC BY 4.0, Creative Commons Attribution 4.0 International
Link:http://creativecommons.org/licenses/by/4.0/
Description:This is the standard Creative Commons license that gives others maximum freedom to do what they want with the work as long as they credit the author.

Secondary language

Language:Slovenian
Keywords:razdaljno uravnoteženi graf, $\ell$-razdaljno uravnoteženi graf, posplošeni Petersenov graf, premer


Back