Zobrazeno 1 - 10 of 39 pro vyhledávání: '"Richard M. Low"'
1
Akademický článek
New Diagonal Graph Ramsey Numbers of Unicyclic Graphs
Autor: Richard M. Low, Ardak Kapbasov
Publikováno v: Theory and Applications of Graphs, Vol 10, Iss 1, Pp 1-12 (2023)
Grossman conjectured that R(G, G) = 2 · |V (G)| − 1, for all simple connected unicyclic graphs G of odd girth and |V (G)| ≥ 4. In this note, we prove his conjecture for various classes of G containing a triangle. In addition, new diagonal graph
Externí odkaz: https://doaj.org/article/0d0c1cdb2eaf48d7a7c3e3cfd51fef4c
Zobrazit plný text záznamu
2
Akademický článek
The integer-antimagic spectra of Hamiltonian graphs
Autor: Ugur Odabasi, Dan Roberts, Richard M. Low
Publikováno v: Electronic Journal of Graph Theory and Applications, Vol 9, Iss 2, Pp 301-308 (2021)
Let A be a nontrivial abelian group. A connected simple graph G = (V, E) is A-antimagic, if there exists an edge labeling f : E(G)→A ∖ {0A} such that the induced vertex labeling f+(v)=∑{u, v}∈E(G)f({u, v}) is a one-to-one map. The integer-ant
Externí odkaz: https://doaj.org/article/33d4419bedd148889446f509d610b880
Zobrazit plný text záznamu
3
Akademický článek
Orthogonal embeddings of graphs in Euclidean space
Autor: Wai Chee Shiu, Richard M. Low
Publikováno v: Electronic Journal of Graph Theory and Applications, Vol 7, Iss 2, Pp 373-381 (2019)
Let G = (V, E) be a simple connected graph. An injective function f : V → Rn is called an n-dimensional (or n-D) orthogonal labeling of G if uv, uw ∈ E implies that (f(v) − f(u)) ⋅ (f(w) − f(u)) = 0, where ⋅ is the usual dot product in Eu
Externí odkaz: https://doaj.org/article/9891bc1933a6431b84dd31a40e8144c9
Zobrazit plný text záznamu
4
Akademický článek
On friendly index sets of k-galaxies
Autor: S-M Lee, Richard M. Low, H.K. Ng, Y-C Wang
Publikováno v: Electronic Journal of Graph Theory and Applications, Vol 7, Iss 1, Pp 1-10 (2019)
Let G = (V, E) be a graph. A vertex labeling f : V → Z2 induces an edge labeling f * : E → Z2 defined by f * (xy) = f(x) + f(y), for each edge xy ∈ E. For i ∈ Z2, let vf(i) = ∣{v ∈ V : f(v) = i}∣ and ef(i) = ∣{e ∈ E : f * (e) = i}
Externí odkaz: https://doaj.org/article/0753e69340404efb9654ba119f4689ba
Zobrazit plný text záznamu
5
Akademický článek
Notes on the combinatorial game: graph Nim
Autor: Richard M. Low, W.H. Chan
Publikováno v: Electronic Journal of Graph Theory and Applications, Vol 4, Iss 2, Pp 190-205 (2016)
The combinatorial game of Nim can be played on graphs. Over the years, various Nim-like games on graphs have been proposed and studied by N.J. Calkin et al., L.A. Erickson and M. Fukuyama. In this paper, we focus on the version of Nim played on graph
Externí odkaz: https://doaj.org/article/bc276cbf1a54467490359d725d83ac0c
Zobrazit plný text záznamu
7
The Integer-antimagic Spectra of Graphs with a Chord
Autor: Jinze Zheng, Richard M. Low, Dan Roberts
Publikováno v: Theory and Applications of Graphs, Vol 8, Iss 1 (2021)
Let $A$ be a nontrival abelian group. A connected simple graph $G = (V, E)$ is $A$-antimagic if there exists an edge labeling $f: E(G) \to A \setminus \{0\}$ such that the induced vertex labeling $f^+: V(G) \to A$, defined by $f^+(v) = \sum_{uv\in E(
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d8e843b51c8edeaa62b270e98be5db25
https://doi.org/10.20429/tag.2021.080101
Zobrazit plný text záznamu
8
The maximum rank of 2 × ⋯ × 2 tensors over 𝔽2
Autor: Richard M. Low, Stavros G. Stavrou
Publikováno v: Linear and Multilinear Algebra. 69:394-402
We determine that the maximum rank of an order-n (≥2) tensor with format 2×⋯×2 over the finite field F2 is 2⋅3n/2−1 for even n, and 3⌊n/2⌋ for odd n. Since tensor rank is non-increasing upon taking...
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::0da337e490c136c6ba3c4545cf947ac7
https://doi.org/10.1080/03081087.2020.1758019
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje