Results 1 to 10 of about 5,433,596 (264)
Restrained Domination in Self-Complementary Graphs [PDF]
A self-complementary graph is a graph isomorphic to its complement. A set S of vertices in a graph G is a restrained dominating set if every vertex in V(G) \ S is adjacent to a vertex in S and to a vertex in V(G) \ S.
Desormeaux Wyatt J. +2 more
doaj +7 more sources
The Spectrum of Weighted Lexicographic Product on Self-Complementary Graphs
The lexicographic product, a powerful binary operation in graph theory, offers methods for creating a novel graph by establishing connections between each vertex of one graph and every vertex of another.
Xiaoxiao Zhang, Zenghui Fang
doaj +2 more sources
Multi-Perspective Spatio-Temporal Feature Fusion Model for Urban Traffic Flow Prediction [PDF]
Urban traffic flow is difficult to forecast accurately because its evolution is non-linear and governed by dependencies that operate over different spatial and temporal ranges.
Avazjon Marakhimov +5 more
doaj +2 more sources
Predicting antibody self-association with sequence–structure fusion models: the central role of CSI-BLI in early developability screening [PDF]
Antibody-based biologics are expanding rapidly, yet challenges in development from self-association, high viscosity, aggregation, and unfavorable clearance underscore the need for accurate in silico screening.
Shafayat Ahmed +15 more
doaj +2 more sources
On Nordhaus-Gaddum type relations of δ-complement graphs
The δ-complement graphs were introduced by Amrithalakshmi et al. in 2022. In their work, some interesting properties of the graphs such as δ-self-complementary, adjacency, and hamiltonicity were studied.
Panupong Vichitkunakorn +2 more
doaj +1 more source
On Neutrosophic Vague Graphs [PDF]
In this work, the new concept of neutrosophic vague graphs are introduced form the ideas of neutrosophic vague sets. Moreover, some remarkable properties of strong neutrosophic vague graphs, complete neutrosophic vague graphs and self-complementary ...
S. Satham Hussain +2 more
doaj +1 more source
Correlations in totally symmetric self‐complementary plane partitions
Totally symmetric self‐complementary plane partitions (TSSCPPs) are boxed plane partitions with the maximum possible symmetry. We use the well‐known representation of TSSCPPs as a dimer model on a honeycomb graph enclosed in 1/12 of a hexagon with free ...
Arvind Ayyer, Sunil Chhita
doaj +1 more source
A Study of Complex Dombi Fuzzy Graph With Application in Decision Making Problems
A complex fuzzy set (CFS) is a generalization of a fuzzy set (FS) in which a limit of degrees occurs on the complex plane with unit disc. The averaging operators are a key part of turning all the data into one value.
Ehsan Mehboob Ahmed Butt +4 more
doaj +1 more source
Cyclic Partitions of Complete and Almost Complete Uniform Hypergraphs
We consider cyclic partitions of the complete k-uniform hypergraph on a finite set V, minus a set of s edges, s ≥ 0. An s-almost t-complementary k-hypergraph is a k-uniform hypergraph with vertex set V and edge set E for which there exists a permutation ...
Dilbarjot, Gosselin Shonda Dueck
doaj +1 more source
Multiclass geospatial object detection in high-spatial-resolution remote-sensing images (HSRIs) has recently attracted considerable attention in many remote-sensing applications as a fundamental task.
Shu Tian +9 more
doaj +1 more source

