Biblio Discovery — Demo Discovery Service

3 results for "Tam Bit-Shun"

Showing 1–3 · 4.38 seconds · RSS

  1. Journal Article

    On the maximal Aa -index of graphs with a prescribed number of edges

    Chang Ting-Chung; Tam Bit-Shun

    Special Matrices, Vol. 13 No. 1 · 2025 · English · DOAJ Scopus

    …}\left(G) is called the Aα{A}_{\alpha }-index of GG. Chang and Tam (Graphs of fixed order and size with maximal-index, Linear Algebra Appl. 673 (2023), 69–100) have solved the problem of determining graphs with maximal Aα{A}_{\alpha }-index over G(n,m){\mathcal{G}}\left(n,m), the class of graphs…

  2. Preprint Full text

    Linear Equations over cones and Collatz-Wielandt numbers

    Tam, Bit-Shun; Schneider, Hans

    arXiv · 2001 · English · arXiv

    Let $K$ be a proper cone in $\IR^n$, let $A$ be an $n\times n$ real matrix that satisfies $AK\subseteq K$, let $b$ be a given vector of $K$, and let $λ$ be a given positive real number. The following two linear equations are considered in this paper: (i)$(λI_n-A)x=b$, $x\in K$, and…

  3. Preprint Full text

    On the invariant faces associated with a cone-preserving map

    Tam, Bit-Shun; Schneider, Hans

    arXiv · 1998 · English · arXiv

    For an $n \times n$ nonnegative matrix $P$, an isomorphism is obtained between the lattice of initial subsets (of ${1,...,n}$) for $P$ and the lattice of $P$-invariant faces of the nonnegative orthant $\IR^{n}_{+}$. Motivated by this isomorphism, we generalize some of the known combinatorial…