Combinatorially Orthogonal Paths
Communications on Number Theory and Combinatorial Theory · 2023
DOI: 10.70013/l1vy8zr6 ↗Kurz gefasst
Fachartikel in der Zeitschrift Communications on Number Theory and Combinatorial Theory, 2023. Verfasst von Sean Bailey und 2 weiteren Autor:innen.
Abstract (Originalsprache)
Vectors x=(x1,x2,...,xn)T and y=(y1,y2,...,yn)T are combinatorially orthogonal if |{i:xiyi≠0}|≠1. An undirected graph G=(V,E) is a combinatorially orthogonal graph if there exists f:V→ℝn such that for any u,v∈V, uv∉E iff f(u) and f(v) are combinatorially orthogonal. We will show that every graph has a combinatorially orthogonal representation. We will show the bounds for the combinatorially orthogonal dimension of any path Pn.
Zitieren
APA
Bailey, S., Brown, D., & Beaseley, L. (2023). Combinatorially Orthogonal Paths. Communications on Number Theory and Combinatorial Theory. https://doi.org/10.70013/l1vy8zr6
Vancouver
Bailey S, Brown D, Beaseley L. Combinatorially Orthogonal Paths. Communications on Number Theory and Combinatorial Theory. 2023. doi:10.70013/l1vy8zr6
BibTeX
@article{Bailey2023,
author = {Bailey, Sean and Brown, David and Beaseley, Leroy},
title = {Combinatorially Orthogonal Paths},
journal = {Communications on Number Theory and Combinatorial Theory},
year = {2023},
doi = {10.70013/l1vy8zr6}
}
EUVIMED