Block transitivity and degree matrices

0Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

We say that a square matrix M of order r is a degree matrix of a given graph G if there is a so-called equitable partition of its vertices into r blocks with the following property: For any i and j it holds that a vertex from the ith block of the partition has exactly mi, j neighbors inside the jth block. We ask whether for a given degree matrix M, there exists a graph G such that M is a degree matrix of G, and in addition, for any two edges e, f spanning between the same pair of blocks there exists an automorphism of G that sends e to f. In this work we affirmatively answer the question for all degree matrices and show a way to construct a graph that witnesses this fact. We further explore a case where the automorphism is required to exchange a given pair of edges and show some positive and negative results. © 2007 Elsevier Ltd. All rights reserved.

Cite

CITATION STYLE

APA

Soto, J., & Fiala, J. (2008). Block transitivity and degree matrices. European Journal of Combinatorics, 29(5), 1160–1172. https://doi.org/10.1016/j.ejc.2007.06.027

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free