FULLY INDECOMPOSABLE AND NEARLY DECOMPOSABLE GRAPHS

被引：0

作者：

Aaghabali, M. ^{[1
]}

Akbari, S. ^{[2
,3
]}

Ariannejad, M. ^{[4
]}

Tajfirouz, Z. ^{[4
]}

机构：

[1] Islamic Azad Univ, Mobarakeh Branch, Dept Math, Mobarakeh, Isfahan, Iran

[2] Sharif Univ Technol, Dept Math Sci, POB 11155-9415, Tehran, Iran

[3] Inst Res Fundamental Sci IPM, Sch Math, POB 19395-5746, Tehran, Iran

[4] Univ Zanjan, Dept Math, POB 45371-38791, Zanjan, Iran

来源：

CONTRIBUTIONS TO DISCRETE MATHEMATICS | 2017年 / 11卷 / 02期

关键词：

Permanent; Partly Decomposable; Fully Indecomposable; Factor;

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Let A be an n-square non-negative matrix. If A contains no s x t zero submatrix, where s + t = n, then it is called fully indecomposable. Moreover, a graph G is said to be fully indecomposable if its adjacency matrix is fully indecomposable. In this paper we provide some necessary and sufficient conditions for a graph to be fully indecomposable. Among other results we prove that a regular connected graph is fully indecomposable if and only if it is not bipartite.

引用

页码：1 / 8

页数：8

共 50 条

[41] Classical graphs decomposition and their totally decomposable graphs
Quaddoura, Ruzayn
Mansour, Khalid
INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2010, 10 (01): : 240 - 250
[42] On the minimum rank of the join of graphs and decomposable graphs
Barioli, Francesco
Fallat, Shaun
LINEAR ALGEBRA AND ITS APPLICATIONS, 2007, 421 (2-3) : 252 - 263
[43] Wishart distributions for decomposable graphs
Letac, Gerard
Massam, Helene
ANNALS OF STATISTICS, 2007, 35 (03): : 1278 - 1323
[44] Bayesian clustering in decomposable graphs
Bornn, Luke
Caron, Francois
BAYESIAN ANALYSIS, 2011, 6 (04): : 829 - 845
[45] Algebras for Tree Decomposable Graphs
Bruni, Roberto
Montanari, Ugo
Sammartino, Matteo
GRAPH TRANSFORMATION, ICGT 2020, 2020, 12150 : 203 - 220
[46] CONSTRUCTING VERTEX DECOMPOSABLE GRAPHS
Lashani, E.
Jahan, A. Soleyman
BULLETIN OF THE IRANIAN MATHEMATICAL SOCIETY, 2016, 42 (04) : 809 - 817
[47] FULLY INDECOMPOSABLE EXPONENTS OF PRIMITIVE MATRICES
BRUALDI, RA
LIU, B
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 1991, 112 (04) : 1193 - 1201
[48] Hereditarily indecomposable inverse limits of graphs
Kawamura, K
Tuncali, HM
Tymchatyn, ED
FUNDAMENTA MATHEMATICAE, 2005, 185 (03) : 195 - 210
[49] Split decomposition and graph-labelled trees: Characterizations and fully dynamic algorithms for totally decomposable graphs
Gioan, Emeric
Paul, Christophe
DISCRETE APPLIED MATHEMATICS, 2012, 160 (06) : 708 - 733
[50] Crossing Numbers of Nearly Complete Graphs and Nearly Complete Bipartite Graphs
Chia, Gek L.
Lee, Chan L.
ARS COMBINATORIA, 2015, 121 : 437 - 446

← 1 2 3 4 5 →