The Determinant of Graphs Joined by $j$ Edges

Daniel Pinzon, Boyko Gyurov


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


  • There are currently no refbacks.

Copyright 2019 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|