2000 character limit reached
On Signed Distance in Product of Signed Graphs (2009.08707v1)
Published 18 Sep 2020 in math.CO
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Collections
Sign up for free to add this paper to one or more collections.
