Results 281 to 290 of about 952,320 (325)
Some of the next articles are maybe not open access.
Graphs and Orders in Ramsey Theory and in Dimension Theory
1985The purpose of this paper is to present a concise and relatively self contained treatment of recent results linking partially ordered sets with topics more traditionally associated with graph theory and combinatorics: Ramsey theory and chromatic graph theory.
J. W. Walker +2 more
openaire +2 more sources
Near Rings, Fuzzy Ideals, and Graph Theory
, 2013Near Rings, Fuzzy Ideals, and Graph Theory explores the relationship between near rings and fuzzy sets and between near rings and graph theory. It covers topics from recent literature along with several characterizations.
B. Satyanarayana, K. Prasad
semanticscholar +1 more source
Local-Aggregation Graph Networks
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2020Convolutional neural networks (CNNs) provide a dramatically powerful class of models, but are subject to traditional convolution that can merely aggregate permutation-ordered and dimension-equal local inputs.
Jianlong Chang +5 more
semanticscholar +1 more source
On The (k,t)-Metric Dimension Of Graphs
Computer/law journal, 2020Let $(X,d)$ be a metric space. A set $S\subseteq X$ is said to be a $k$-metric generator for $X$ if and only if for any pair of different points $u,v\in X$, there exist at least $k$ points $w_1,w_2, \ldots w_k\in S$ such that $d(u,w_i)\ne d(v,w_i ...
A. Estrada-Moreno +2 more
semanticscholar +1 more source
Dimension reduction for compositional data with weights based on graph theory
2022A popular tool of dimension reduction in many statistical fields is principal component analysis (PCA). For the field of compositional data analysis (CoDA) weighting can be seen as a similar approach of dimension reduction as PCA. It is a desire to find those variables which explain a big part or even the majority of the variance of the whole data ...
openaire +1 more source
The (generalized) orthogonality dimension of (generalized) kneser graphs: bounds and applications
Cybersecurity and Cyberforensics Conference, 2020The orthogonality dimension of a graph G = (V, E) over a field F is the smallest integer t for which there exists an assignment of a vector uv ∈ Ft with ⟨uv, uv⟩ ≠ 0 to every vertex v ∈ V, such that ⟨uv, uv'⟩ = 0 whenever v and v' are adjacent vertices ...
Alexander Golovnev, I. Haviv
semanticscholar +1 more source
Quantification of risk mitigation environment of supply chains using graph theory and matrix methods
, 2007Today supply chains leverage their partner's competencies and in the process also inherit the risks associated with various links of a supply chain. Although it is impossible to completely eliminate various risks, an environment can be created which ...
M. Faisal, D. K. Banwet, R. Shankar
semanticscholar +1 more source
DIMENSION GROUPS AND EMBEDDINGS OF GRAPH ALGEBRAS
, 1994If Γ is a graph, with distinguished vertex *, let A(Γ) denote the non-commutative path algebra on the space of semi-infinite paths in Γ beginning at *. We discuss embeddings A(Γ1) → A(Γ2) of AF algebras associated with graphs Γ1 and Γ2 from a dimension ...
David E. Evans, J. Gould
semanticscholar +1 more source
Computing Basis and Dimension of Chloroquine and Hydroxychloroquine by Using Chemical Graph Theory
Polycyclic Aromatic Compounds, 2022Yogesh Singh +3 more
openaire +1 more source
Occlusal Vertical Dimension: Best Evidence Consensus Statement
Journal of Prosthodontics, 2021Charles J Goodacre +2 more
exaly