Open AccessStrongly self-inverse weighted graphs
Author(s) -
Abraham Berman,
Naomi Shaked-Monderer,
Subhasis Panda
Publication year - 2020
Publication title -
the electronic journal of linear algebra
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.447
H-Index - 31
eISSN - 1537-9582
pISSN - 1081-3810
DOI - 10.13001/ela.2020.4927
Subject(s) - mathematics , bipartite graph , combinatorics , weight function , inverse , complete bipartite graph , matching (statistics) , edge transitive graph , graph , discrete mathematics , line graph , graph power , mathematical analysis , statistics , geometry
Let G be a connected, bipartite graph. Let Gw denote the weighted graph obtained from G by assigning weights to its edges using the positive weight function w : E(G) ! (0;1). In this article we consider a class Hnmc of bipartite graphswith unique perfect matchings and the family WG of weight functions with weight 1 on the matching edges, and characterize all pairs G in Hnmc and w in WG such that Gw is strongly self-inverse.