Distance mean-regular graphs

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 Γ be a graph with vertex set V , diameter D , adjacency matrix A , and adjacency algebra A . Then, Γ is distance mean-regular when, for a given u...

Full description

Saved in:

Bibliographic Details
Published in:	Designs, codes, and cryptography Vol. 84; no. 1-2; pp. 55 - 71
Main Authors:	Diego, V., Fiol, M. A.
Format:	Journal Article Publication
Language:	English
Published:	New York Springer US 01.07.2017 Springer Nature B.V
Subjects:	05 Combinatorics 05C Graph theory 05E Algebraic combinatorics Adjacency Algebra Algebra Circuits Classificació AMS Coding and Information Theory Combinacions (Matemàtica) Combinatorial analysis Combinatòria Computation Computer Science Cryptology Data Structures and Information Theory Discrete Mathematics in Computer Science Distance mean-regular graph Distance-regular graph Grafs, Teoria de Graph theory Graphs Information and Communication Interlacing Intersection mean-matrix Matemàtica discreta Matemàtiques i estadística Spectrum Teoria de grafs Vertex-transitive graph Àrees temàtiques de la UPC 05E30 Vertex-transitive graph 05C50 Interlacing Adjacency Algebra Distance-regular graph Intersection mean-matrix Distance mean-regular graph Spectrum
ISSN:	0925-1022, 1573-7586
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!