Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Distance mean-regular graphs

Autor
Diego, V.; Fiol, M.
Tipus d'activitat
Article en revista
Revista
Designs codes and cryptography
Data de publicació
2017-07
Volum
84
Número
1
Pàgina inicial
55
Pàgina final
71
DOI
https://doi.org/10.1007/s10623-016-0208-5 Obrir en finestra nova
Projecte finançador
Tecnicas de optimizacion en teoria de grafos, grupos y combinatoria. aplicaciones a redes, algoritmos y protocolos de comunicacion.
Repositori
http://hdl.handle.net/2117/91052 Obrir en finestra nova
URL
https://link.springer.com/article/10.1007%2Fs10623-016-0208-5 Obrir en finestra nova
Resum
We introduce the concept of distance mean-regular graph, which can be seen as a generalization of both vertex-transitive and distance-regular graphs. Let G be a graph with vertex set V , diameter D, adjacency matrix A, and adjacency algebra A. Then, G is distance mean-regular when, for a given u ¿ V , the averages of the intersection numbers p h ij (u, v) = |Gi(u) n Gj (v)| (number of vertices at distance i from u and distance j from v) computed over all vertices v at a given distance h ¿ {0, ...
Citació
Fiol, M., Diego, V. Distance mean-regular graphs. "Designs codes and cryptography", 2017, vol. 84, núm. 1, p. 55-71.
Paraules clau
Adjacency Algebra, Distance mean-regular graph, Distance-regular graph, Interlacing, Intersection mean-matrix, Spectrum, Vertex-transitive graph
Grup de recerca
COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions

Participants

Arxius