Results 21 to 30 of about 1,519,388 (324)
Positional graphs and conditional structure of weakly null sequences [PDF]
Advances in Mathematics, 2011 We prove that, unless assuming additional set theoretical axioms, there are no reflexive space without unconditional sequences of density the continuum. We give for every integer $n$ there are normalized weakly-null sequences of length $\om_n$ without unconditional subsequences.
J. López-Abad, Stevo Todorčević
openalex +3 more sources
International Journal of Digital Earth, 2023 In recent years, the use of convolutional neural networks (CNNs) and graph neural networks (GNNs) to identify hyperspectral images (HSIs) has achieved excellent results, and such methods are widely used in agricultural remote sensing, geological ...
Jing Yang +5 more
doaj +2 more sources
On the Storage–Communication Trade-Off in Graph-Based X-Secure T-Private Linear Computation [PDF]
EntropyThe problem of graph-based X-secure T-private linear computation (GXSTPLC) is to allow a user to retrieve a linear combination of K messages from a set of N distributed servers that store the messages in a graph-based fashion, i.e., each message is ...
Yueyang Liu, Haobo Jia, Zhuqing Jia
doaj +2 more sources
On Null Vertex in Fuzzy Graphs
International Journal of Analysis and ApplicationsWe introduce a new type of vertex in fuzzy graphs, namely null vertex, which is neither a boundary vertex nor an interior vertex. Here, we initiate a study on the null vertex in fuzzy graphs, explore its properties and establish its presence in various types of fuzzy graphs.
Meenu Sunil, J. Suresh Kumar
openalex +3 more sources
BarekengAssume that be an undirected simple graph with vertex set and edge set . The edge irregular reflexive -labeling of graph is a labeling selects positive integers from 1 to as edge labels and non negative even numbers from 0 to as vertex ...
Diari Indriati +2 more
doaj +3 more sources
PCCP of wheel graph family with null, chain, fan and cycle graph
Journal of Mathematical and Computational Science, 2021 openalex +2 more sources
Zero-Sum Magic Labelings and Null Sets of Regular Graphs [PDF]
The Electronic Journal of Combinatorics, 2014 For every $h\in \mathbb{N}$, a graph $G$ with the vertex set $V(G)$ and the edge set $E(G)$ is said to be $h$-magic if there exists a labeling $l : E(G) \rightarrow\mathbb{Z}_h \setminus \{0\}$ such that the induced vertex labeling $s : V (G) \rightarrow \mathbb{Z}_h$, defined by $s(v) =\sum_{uv \in E(G)} l(uv)$ is a constant map.
Saieed Akbari, Farhad Rahmati, S. Zare
openalex +3 more sources
60/102 Null Boundary Cellular Automata based expander graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2010 Expander graphs are useful in the design and analysis of communication networks. Mukhopadhyay et al. introduced a method to generate a family of expander graphs based on nongroup two predecessor single attractor Cellular Automata(CA). In this paper we propose a method to generate a family of expander graphs based on 60/102 Null Boundary CA(NBCA) which ...
Sung‐Jin Cho +4 more
openalex +2 more sources
Graph‐based spectrum sensing algorithm via nonlinear function regulation
IET Radar, Sonar & NavigationTo solve the difficulties in threshold selection and poor performance under low signal‐to‐noise ratio (SNR) conditions in existing spectrum sensing algorithms, a graph‐based spectrum sensing algorithm using nonlinear function regulation was proposed. The
Shanshan Wu, Guobing Hu
doaj +2 more sources
networksis: A Package to Simulate Bipartite Graphs with Fixed Marginals Through Sequential Importance Sampling [PDF]
Journal of Statistical Software, 2008 The ability to simulate graphs with given properties is important for the analysis of social networks. Sequential importance sampling has been shown to be particularly effective in estimating the number of graphs adhering to fixed marginals and in ...
Ryan Admiraal, Mark S. Handcock
doaj +1 more source