Nicely distance-balanced graphs (Q2441948)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Nicely distance-balanced graphs	scientific article

Statements

scholarly article

0 references

Nicely distance-balanced graphs (English)

0 references

zbMATH Open document ID

0 references

10.1016/j.ejc.2013.12.002

0 references

Klavdija Kutnar

0 references

Štefko Miklavič

0 references

European Journal of Combinatorics

0 references

publication date

31 March 2014

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

zbMATH Keywords

strongly distance-balanced graphs

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.ejc.2013.12.002

0 references

0 references

Strongly distance-balanced graphs and graph products

0 references

0 references

The complexity of obtaining a distance-balanced graph

0 references

0 references

0 references

Distance degree regular graphs

0 references

On distance-balanced graphs

0 references

0 references

Distance-balanced graphs

0 references

0 references

Classification of cubic symmetric tricirculants

0 references

Distance-balanced graphs: symmetry conditions

0 references

The strongly distance-balanced property of the generalized Petersen graphs

0 references

On the connectivity of bipartite distance-balanced graphs

0 references

A note on the distance-balanced property of generalized Petersen graphs

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2441948

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2441948&oldid=35380041"