@Article{AAM-36-3,
author = {Xia, Wang and Hong, Bian and Yu, Haizheng},
title = {Bicyclic Graphs with Unicyclic or Bicyclic Inverses},
journal = {Annals of Applied Mathematics},
year = {2020},
volume = {36},
number = {3},
pages = {270--281},
abstract = {<p style="text-align: justify;">A graph $G$ is nonsingular if its adjacency matrix $A(G)$ is nonsingular. A nonsingular graph $G$ is said to have an inverse $G^+$ if $A(G)^{−1}$ is signature similar
to a nonnegative matrix. Let $\mathcal{H}$&nbsp;be the class of connected bipartite graphs with
unique perfect matchings. We present a characterization of bicyclic graphs in
$\mathcal{H}$ which possess unicyclic or bicyclic inverses.</p>},
issn = {},
doi = {https://doi.org/2020-AAM-18592},
url = {https://global-sci.com/article/72666/bicyclic-graphs-with-unicyclic-or-bicyclic-inverses}
}