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 条

[1] NEARLY REDUCIBLE AND NEARLY DECOMPOSABLE SPECIAL CLASSES OF IRREDUCIBLE AND FULLY INDECOMPOSABLE MATRICES
HEDRICK, MB
NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1973, 20 (01): : A48 - A48
[2] NEARLY REDUCIBLE AND NEARLY DECOMPOSABLE - SPECIAL CLASSES OF IRREDUCIBLE AND FULLY INDECOMPOSABLE MATRICES
HEDRICK, MB
NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1971, 18 (02): : 404 - &
[3] r-Indecomposable and r-nearly decomposable matrices
You, LH
Liu, BL
Shen, J
LINEAR ALGEBRA AND ITS APPLICATIONS, 2005, 407 : 105 - 116
[4] Fully Decomposable Split Graphs
Broersma, Hajo
Kratsch, Dieter
Woeginger, Gerhard J.
COMBINATORIAL ALGORITHMS, 2009, 5874 : 105 - +
[5] Point partition numbers: Decomposable and indecomposable critical graphs
von Postel, Justus
Schweser, Thomas
Stiebitz, Michael
DISCRETE MATHEMATICS, 2022, 345 (08)
[6] Fully decomposable split graphs
Broersma, Hajo
Kratsch, Dieter
Woeginger, Gerhard J.
EUROPEAN JOURNAL OF COMBINATORICS, 2013, 34 (03) : 567 - 575
[7] Nearly complete graphs decomposable into large induced matchings and their applications
Alon, Noga
Moitra, Ankur
Sudakov, Benny
JOURNAL OF THE EUROPEAN MATHEMATICAL SOCIETY, 2013, 15 (05) : 1575 - 1596
[8] Nearly Complete Graphs Decomposable into Large Induced Matchings and their Applications
Alon, Noga
Moitra, Ankur
Sudakov, Benny
STOC'12: PROCEEDINGS OF THE 2012 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2012, : 1079 - 1089
[9] Decomposable and indecomposable critical hypergraphs
Stiebitz, Michael
Storch, Patrick
Toft, Bjarne
JOURNAL OF COMBINATORICS, 2016, 7 (2-3) : 423 - 451
[10] Cyclically indecomposable triple systems that are decomposable
Department of Mathematics, University of Rostock, Universitaetsplatz 1, 18051 Rostock, Germany
不详
J. Comb. Math. Comb. Comp., 2007, (103-122):

← 1 2 3 4 5 →