Zobrazeno 1 - 10
of 20
pro vyhledávání: '"Ber-Lin Yu"'
Publikováno v:
Heliyon, Vol 10, Iss 19, Pp e38580- (2024)
New-typed matrix inverses based on the Hartwig-Spindelböck decomposition were investigated, which is called the strong B-T inverse, as a generalization of the B-T inverse. The relationships between the above inverse and other matrix inverses were es
Externí odkaz:
https://doaj.org/article/244bca9945594d5184ec079379fd5fa1
Publikováno v:
AIMS Mathematics, Vol 7, Iss 1, Pp 651-666 (2022)
The well-studied eccentric connectivity index directly consider the contribution of all edges in a graph. By considering the total eccentricity sum of all non-adjacent vertex, Hua et al. proposed a new topological index, namely, eccentric connectivit
Externí odkaz:
https://doaj.org/article/088ab332faa04ae593c1949ba095a593
Publikováno v:
Symmetry, Vol 14, Iss 3, p 512 (2022)
Identifying and classifying the potentially eventually positive sign patterns and the potentially eventually exponentially positive sign patterns of orders greater than 3 have been raised as two open problems since 2010. In this article, we investiga
Externí odkaz:
https://doaj.org/article/b48ec455c86c48fa9bf5361a5747eb55
Publikováno v:
Symmetry, Vol 13, Iss 9, p 1669 (2021)
An n×n matrix A is called eventually exponentially positive (EEP) if etA=∑k=0∞tkAkk!>0 for all t≥t0, where t0≥0. A matrix whose entries belong to the set {+,−,0} is called a sign pattern. An n×n sign pattern A is called potentially eventu
Externí odkaz:
https://doaj.org/article/172c184f714049328ef657ace056dd35
Publikováno v:
Arab Journal of Mathematical Sciences, Vol 23, Iss 2, Pp 231-241 (2017)
A sign pattern is a matrix whose entries belong to the set {+,−,0}. An n-by-nsign pattern A is said to allow an eventually positive matrix or be potentially eventually positive if there exist at least one real matrix A with the same sign pattern as
Externí odkaz:
https://doaj.org/article/748d93163556454cbb8df518a63b8b52
Publikováno v:
AIMS Mathematics, Vol 7, Iss 1, Pp 651-666 (2022)
The well-studied eccentric connectivity index directly consider the contribution of all edges in a graph. By considering the total eccentricity sum of all non-adjacent vertex, Hua et al. proposed a new topological index, namely, eccentric connectivit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d35a15877400b3b64888d2ba0d0950eb
https://www.aimspress.com/article/doi/10.3934/math.2022041?viewType=HTML
https://www.aimspress.com/article/doi/10.3934/math.2022041?viewType=HTML
Autor:
Gu-Fang Mou, Ber-Lin Yu
Publikováno v:
Journal of Discrete Mathematical Sciences and Cryptography. 22:915-922
In this paper, a positive answer to the question (I) in Johnson and Link [C. R. Johnson, J. A. Link, The extent to which triangular sub-patterns explain minimum rank, Discrete Applied Mathe...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::54d75502307e3137c7958361f031242f
https://doi.org/10.1080/09720529.2019.1614247
https://doi.org/10.1080/09720529.2019.1614247
Publikováno v:
Symmetry, Vol 13, Iss 1669, p 1669 (2021)
Symmetry
Volume 13
Issue 9
Symmetry
Volume 13
Issue 9
An n×n matrix A is called eventually exponentially positive (EEP) if etA=∑k=0∞tkAkk!>
0 for all t≥t0, where t0≥0. A matrix whose entries belong to the set {+,−,0} is called a sign pattern. An n×n sign pattern A is called potentiall
0 for all t≥t0, where t0≥0. A matrix whose entries belong to the set {+,−,0} is called a sign pattern. An n×n sign pattern A is called potentiall
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cd2d5e0f9e3ce9debd9fed87af830faf
https://doi.org/10.3390/sym13091669
https://doi.org/10.3390/sym13091669
Autor:
Zhenfeng Yu, Ber-Lin Yu
Publikováno v:
Far East Journal of Mathematical Education. 17:63-69
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f3c62e76c71593a39bcb76714b0531fb
https://doi.org/10.17654/me017020063
https://doi.org/10.17654/me017020063
Publikováno v:
Arab Journal of Mathematical Sciences, Vol 23, Iss 2, Pp 231-241 (2017)
A sign pattern is a matrix whose entries belong to the set { + , − , 0 } . An n -by- n sign pattern A is said to allow an eventually positive matrix or be potentially eventually positive if there exist at least one real matrix A with the same sign
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e0e7f26e576d865af97ec6a2d905dd33
https://doi.org/10.1016/j.ajmsc.2016.11.002
https://doi.org/10.1016/j.ajmsc.2016.11.002