Signed distance in signed graphs

Autor:	Thomas Zaslavsky, P. Soorya, K. A. Germina, T. V. Shijin, Shahul K. Hameed
Rok vydání:	2021
Předmět:	Combinatorics Numerical Analysis Matrix (mathematics) Algebra and Number Theory Explicit formulae Discrete Mathematics and Combinatorics Distance spectrum Signed distance function Geometry and Topology MathematicsofComputing_DISCRETEMATHEMATICS Mathematics
Zdroj:	Linear Algebra and its Applications. 608:236-247
ISSN:	0024-3795
DOI:	10.1016/j.laa.2020.08.024
Popis:	Signed graphs have their edges labeled either as positive or negative. Here we introduce two types of signed distance matrix for signed graphs. We characterize balance in signed graphs using these matrices and we obtain explicit formulae for the distance spectrum of some unbalanced signed graphs. We also introduce the notion of distance-compatible signed graphs and partially characterize it.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::da4c7a1664c7b608a5266ff6e82cb01e https://doi.org/10.1016/j.laa.2020.08.024 Zobrazit plný text záznamu Full Text from ScienceDirect