On Signed Distance in Product of Signed Graphs

Authors T. V. Shijin, P. Soorya, Shahul Hameed K., K. A. Germina

Publication date 18 September 2020

Distance in graphs (05C12) Signed and weighted graphs (05C22) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph operations (line graphs, products, etc.) (05C76)

Abstract: A signed graph is a graph in which each edge has a positive or negative sign. In this article, first we characterize the distance compatibility in the case of a connected signed graph and discussed the distance compatibility criterion for the cartesian product, lexicographic product and tensor product of signed graphs. We also deal with the distance matrix of the cartesian product, lexicographic product and tensor product of signed graphs in terms of the distance matrix of the factor graphs.

This page was built for publication: On Signed Distance in Product of Signed Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6349376)