UNICYCLIC GRAPHS WITH BICYCLIC INVERSES

被引：7

作者：

Panda, Swarup Kumar ^{[1
]}

机构：

[1] Indian Stat Inst Delhi, Theoret Stat & Math Unit, 7 SJS Sansanwal Marg, New Delhi 110016, India

来源：

CZECHOSLOVAK MATHEMATICAL JOURNAL | 2017年 / 67卷 / 04期

关键词：

adjacency matrix; unicyclic graph; bicyclic graph; inverse graph; perfect matching; BIPARTITE GRAPHS; TREES;

D O I：

10.21136/CMJ.2017.0429-16

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

A graph is nonsingular if its adjacency matrix A(G) is nonsingular. The inverse of a nonsingular graph G is a graph whose adjacency matrix is similar to A(G)(-1) via a particular type of similarity. Let H denote the class of connected bipartite graphs with unique perfect matchings. Tifenbach and Kirkland (2009) characterized the unicyclic graphs in H which possess unicyclic inverses. We present a characterization of unicyclic graphs in H which possess bicyclic inverses.

引用

页码：1133 / 1143

页数：11

共 16 条

[1] On unimodular graphs [J].