On -distance-balanced product graphs

DOI10.1007/S00373-020-02247-9MaRDI QIDQ2657092zbMATH OpenOpenAlexFDO

Authors Janja Jerebic, Sandi Klavžar, Gregor Rus

Publication date 17 March 2021

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1910.01807

zbMATH Keywords

Cartesian productcomplete graphcorona productdiameter-2 graphdistance-balanced graphlexicographic product

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph operations (line graphs, products, etc.) (05C76)

Abstract: A graph $G$ is $ell$-distance-balanced if for each pair of vertices $x$ and $y$ at distance $ell$ in $G$, the number of vertices closer to $x$ than to $y$ is equal to the number of vertices closer to $y$ than to $x$. A complete characterization of $ell$-distance-balanced corona products is given and a characterization of lexicographic products for $ellge3$, thus complementing known results for $ellin1,2$ and correcting an earlier related assertion. A sufficient condition on $H$ which guarantees that $K_n,square,H$ is $ell$-distance-balanced is given and it is proved that if $K_n,square,H$ is $ell$-distance-balanced, then $H$ is an $ell$-distance-balanced graph. A known characterization of $1$-distance-balanced graphs is extended to $ell$-distance-balanced graphs, again correcting an earlier claimed assertion.

Recommendations

• -distance-balanced graphs
• Distance-balanced graphs
• Strongly distance-balanced graphs and graph products
• On 2-distance-balanced graphs
• Quasi--distance-balanced graphs

Cites work

• -distance-balanced graphs
• Bipartite graphs with balanced (a,b)-partitions
• Distance-balanced graphs
• Distance-balanced graphs: symmetry conditions
• Equal opportunity networks, distance-balanced graphs, and Wiener game
• Extremal bicyclic graphs with respect to Mostar index
• Extremal catacondensed benzenoids with respect to the Mostar index
• Maximum values of Szeged index and edge-Szeged index of graphs
• Mostar index
• Nicely distance-balanced graphs
• On 2-distance-balanced graphs
• On distance-balanced graphs
• On some characterizations of antipodal partial cubes
• On the connectivity of bipartite distance-balanced graphs
• On the new extension of distance-balanced graphs
• Remarks on distance-balanced graphs
• Some degree and distance-based invariants of wreath products of graphs
• Strongly distance-balanced graphs and graph products
• The complexity of obtaining a distance-balanced graph
• The strongly distance-balanced property of the generalized Petersen graphs
• Total distance, Wiener index and opportunity index in wreath products of star graphs

Cited in

(10)

• Strongly distance-balanced graphs and graph products
• -distance-balanced graphs
• Mostar index: results and perspectives
• On some problems regarding distance-balanced graphs
• On labeling the vertices of products of complete graphs with distance constraints
• On certain regular nicely distance-balanced graphs
• On distance-balanced generalized Petersen graphs
• On 2-distance-balancedness of vertex transitive generalized Petersen graphs
• The conjecture on distance-balancedness of generalized Petersen graphs holds when internal edges have jumps 3 or 4
• On \(\{1,2\}\)-distance-balancedness of generalized Petersen graphs

This page was built for publication: On \(\ell\)-distance-balanced product graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2657092)