Zobrazeno 1 - 10
of 124
pro vyhledávání: '"LeRoy B. Beasley"'
Publikováno v:
Mathematics, Vol 8, Iss 5, p 676 (2020)
If a graph can be embedded in a smooth orientable surface of genus g without edge crossings and can not be embedded on one of genus g − 1 without edge crossings, then we say that the graph has genus g. We consider a mapping on the set of graphs wit
Externí odkaz:
https://doaj.org/article/12f6bb25ede64d0596fedaf093a62d85
Publikováno v:
Mathematics, Vol 7, Iss 4, p 312 (2019)
A graph has genus k if it can be embedded without edge crossings on a smooth orientable surface of genus k and not on one of genus k − 1 . A mapping of the set of graphs on n vertices to itself is called a linear operator if the image of a union of
Externí odkaz:
https://doaj.org/article/a4123ed0c64443c6ab8407182fec492f
Autor:
LeRoy B. Beasley, Seok-Zun Song
Publikováno v:
Mathematics, Vol 7, Iss 1, p 65 (2019)
Let S be an antinegative semiring. The rank of an m × n matrix B over S is the minimal integer r such that B is a product of an m × r matrix and an r × n matrix. The isolation number of B is the maximal number of nonzero entries in the matrix such
Externí odkaz:
https://doaj.org/article/2b6e00bf4e7e47d7a905da602151735d
Autor:
Seok-Zun Song, LeRoy B. Beasley
Publikováno v:
Linear and Multilinear Algebra. :1-13
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::715a352501dd9f35ec5e6921ed1edd9b
https://doi.org/10.1080/03081087.2023.2190073
https://doi.org/10.1080/03081087.2023.2190073
Autor:
LeRoy B. Beasley
Publikováno v:
The Electronic Journal of Linear Algebra. 37:692-697
Let $m$ and $n$ be positive integers, and let $R =(r_1, \ldots, r_m)$ and $S =(s_1,\ldots, s_n)$ be nonnegative integral vectors. Let $A(R,S)$ be the set of all $m \times n$ $(0,1)$-matrices with row sum vector $R$ and column vector $S$. Let $R$ and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a22c2af237de49e6d0d6fd06c3c9b600
https://doi.org/10.13001/ela.2021.5033
https://doi.org/10.13001/ela.2021.5033
Autor:
LeRoy B. Beasley, Seok-Zun Song
Publikováno v:
Linear and Multilinear Algebra. 70:1732-1743
The minimum rank of a simple graph G is defined to be the smallest possible rank over all symmetric real matrices whose i j t h entry (for i ≠ j ) is nonzero whenever ( i , j ) is an edge in G and ...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f052054d0a537235702ca96d4a4a581b
https://doi.org/10.1080/03081087.2020.1775769
https://doi.org/10.1080/03081087.2020.1775769
Autor:
LeRoy B. Beasley
Publikováno v:
Springer Proceedings in Mathematics & Statistics ISBN: 9783031053740
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d3c3d76e5c2bb3d7c6a85457ca449b0b
https://doi.org/10.1007/978-3-031-05375-7_19
https://doi.org/10.1007/978-3-031-05375-7_19
Publikováno v:
Mathematics, Vol 8, Iss 676, p 676 (2020)
Mathematics and Statistics Faculty Publications
Mathematics
Volume 8
Issue 5
Mathematics and Statistics Faculty Publications
Mathematics
Volume 8
Issue 5
If a graph can be embedded in a smooth orientable surface of genus g without edge crossings and can not be embedded on one of genus g &minus
1 without edge crossings, then we say that the graph has genus g. We consider a mapping on the set of gr
1 without edge crossings, then we say that the graph has genus g. We consider a mapping on the set of gr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6e0d2ffddc723c20dba6915359fefff9
https://www.mdpi.com/2227-7390/8/5/676
https://www.mdpi.com/2227-7390/8/5/676
Autor:
LeRoy B. Beasley, Seok-Zun Song
Publikováno v:
Linear and Multilinear Algebra. 68:1655-1662
A graph has genus k if it can be embedded without edge crossings on a smooth orientable surface of genus k and not on one of genus k−1. A mapping of the set of graphs on n vertices to itself is cal...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9274afce34a78896e9236e1d5263b9e8
https://doi.org/10.1080/03081087.2018.1554028
https://doi.org/10.1080/03081087.2018.1554028
Publikováno v:
Bulletin of the Malaysian Mathematical Sciences Society. 42:437-447
A real symmetric matrix A is called completely positive if there exists a nonnegative real \(n\times k\) matrix B such that \(A = BB^{t}\). The smallest value of k for all possible choices of nonnegative matrices B is called the CP-rank of A. We exte
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b0b9278d7c13f7ac69b2b67901b35300
https://doi.org/10.1007/s40840-017-0490-z
https://doi.org/10.1007/s40840-017-0490-z