The Endospectrum of (n - 3)-regular Graphs of Order n

Nirutt Pipattanajinda


Let G be a graph, the endospectrum of G is the 6-tuple of the following cardinalities Endspec G=(|End(G)|,|HEnd(G)|,|LEnd(G)|,|QEnd(G)|,|SEnd(G)|,|Aut(G)|). In this paper we find the endospectrum of an (n-3)-regular graph of order n.


  • There are currently no refbacks.

The Thai Journal of Mathematics organized and supported by The Mathematical Association of Thailand and Thailand Research Council and the Center for Promotion of Mathematical Research of Thailand (CEPMART).

Copyright 2020 by the Mathematical Association of Thailand.

All rights reserve. No part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means, without the prior permission of the Mathematical Association of Thailand.

|ISSN 1686-0209|