The Determinant of Graphs Joined by $j$ Edges

Daniel Pinzon, Boyko Gyurov

Abstract


In this paper, we refineĀ a result obtained in [4] to compute the determinant of a graph that is constructed by joining two graphs with two new non-coinsiding undirected edges. Here we join the two graphs with $j$ edges and create a procedure to decompose the determinant of the combied graph.


Full Text: PDF

Refbacks

  • 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|