On the fixed-point type Sylvester matrix equations over complete commutative dioids

2014 ◽  
Vol 27 ◽  
Author(s):  
Benham Hashemi ◽  
Mahtab Mirzaei Khalilabadi ◽  
Hanieh Tavakolipour
Keyword(s):  
Fixed Point ◽  
Tensor Product ◽  
Cartesian Product ◽  
Matrix Equations ◽  
Minimum Cardinality ◽  
Sylvester Matrix ◽  
Product Graphs ◽  
Cartesian Product Graphs ◽  
Sylvester Matrix Equations ◽  
Point Type

This paper extends the concept of tropical tensor product defined by Butkovic and Fiedler to general idempotent dioids. Then, it proposes an algorithm in order to solve the fixed-point type Sylvester matrix equations of the form X = A ⊗ X ⊕ X ⊗ B ⊕ C. An application is discussed in efficiently solving the minimum cardinality path problem in Cartesian product graphs.

Bounds for complete cototal domination number of Cartesian product graphs and complement graphs

2021 ◽  
pp. 2150090
Author(s):  
J. Maria Regila Baby ◽  
K. Uma Samundesvari
Keyword(s):  
Dominating Set ◽  
Domination Number ◽  
Cartesian Product ◽  
Minimum Cardinality ◽  
Total Dominating Set ◽  
Product Graphs ◽  
Cartesian Product Graphs

A total dominating set [Formula: see text] is said to be a complete cototal dominating set if [Formula: see text] has no isolated nodes and it is represented by [Formula: see text]. The complete cototal domination number, represented by [Formula: see text], is the minimum cardinality of a [Formula: see text] set of [Formula: see text]. In this paper, the bounds for complete cototal domination number of Cartesian product graphs and complement graphs are determined.

scholarly journals Applications of the Gauge-invariant uniqueness theorem for graph algebras

2002 ◽  
Vol 66 (1) ◽  
pp. 57-67 ◽  
Author(s):  
Teresa Bates
Keyword(s):  
Fixed Point ◽  
Uniqueness Theorem ◽  
Directed Graphs ◽  
Cartesian Product ◽  
Graph Algebras ◽  
Gauge Invariant ◽  
Shift Equivalence ◽  
Product Graphs ◽  
Cartesian Product Graphs ◽  
Fixed Point Algebra

We give applications of the gauge-invariant uniqueness theorem, which states that the Cuntz-Krieger algebras of directed graphs are characterised by the existence of a canonical action of . We classify the C*-algebras of higher order graphs, identify the C*-algebras of cartesian product graphs with a certain fixed point algebra and investigate a relation called elementary shift equivalence on graphs and its effect on the associated graph C*-algebras.

Parameterized solution to a class of sylvester matrix equations

2010 ◽  
Vol 7 (4) ◽  
pp. 479-483
Author(s):  
Yu-Peng Qiao ◽  
Hong-Sheng Qi ◽  
Dai-Zhan Cheng
Keyword(s):  
Matrix Equations ◽  
Sylvester Matrix ◽  
Sylvester Matrix Equations
Sign in / Sign up

Export Citation Format

Share Document