Edge distance-balanced of Hamming graphs

DOI10.1080/09720529.2021.1914363zbMath1502.05047OpenAlexW4213005195MaRDI QIDQ5059606

Hamed Karami

Publication date: 23 December 2022

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2021.1914363

zbMATH Keywords

Hamming graphsnicely distance-balanced graphnicely edge distance-balanced graph

Mathematics Subject Classification ID

Distance in graphs (05C12)

Cites Work

• Unnamed Item
• Perfect 2-colorings of the generalized Petersen graph
• A matrix method for computing Szeged and vertex PI indices of join and composition of graphs
• The exact domination number of the generalized Petersen graphs
• The lattice dimension of a graph
• Nicely distance-balanced graphs
• On the domination number of the generalized Petersen graphs
• A note on edge-distance-balanced property of the generalized Petersen graphsGP(4t, 2)

This page was built for publication: Edge distance-balanced of Hamming graphs