Year: 2020
Type: preprint
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.
Source: arXiv (Cornell University)
Authors: Shijin, T. V., Soorya, P., Hameed, K. Shahul, Germina, K. A.
Language: English
Subfield: Geometry and Topology
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
Awards: G218451527, G5278508730
OpenAlex ID: W3087168258