Results 1 to 10 of about 11,127 (100)
Signless normalized Laplacian for hypergraphs [PDF]
Electronic Journal of Graph Theory and Applications, 2022 The spectral theory of the normalized Laplacian for chemical hypergraphs is further investigated. The signless normalized Laplacian is introduced and it is shown that its spectrum for classical hypergraphs coincides with the spectrum of the normalized ...
Eleonora Andreotti, Raffaella Mulas
doaj +2 more sources
Regular Single Valued Neutrosophic Hypergraphs [PDF]
Neutrosophic Sets and Systems, 2016 In this paper, we define the regular and totally regular single valued neutrosophic hypergraphs, and discuss the order and size along with properties of regular and totally regular single valued neutrosophic hypergraphs.
Muhammad Aslam Malik +3 more
doaj +4 more sources
Regular Bipolar Single Valued Neutrosophic Hypergraphs [PDF]
Neutrosophic Sets and Systems, 2016 In this paper, we define the regular and totally regular bipolar single valued neutrosophic hypergraphs, and discuss the order and size along with properties of regular and totally regular bipolar single valued neutrosophic hypergraphs. We extend work on
Muhammad Aslam Malik +3 more
doaj +5 more sources
Complex Neutrosophic Hypergraphs: New Social Network Models
Algorithms, 2019 A complex neutrosophic set is a useful model to handle indeterminate situations with a periodic nature. This is characterized by truth, indeterminacy, and falsity degrees which are the combination of real-valued amplitude terms and complex-valued phase ...
Muhammad Akram +2 more
exaly +3 more sources
Recursively Constructed Uniform Hypergraphs
AlgorithmsIn this work, we introduce and study a generalization for r-uniform hypergraphs of complement-reducible graphs, the so-called co-graphs. The operations for r-join-hypergraphs are the binary disjoint union of two given r-join-hypergraphs and the r-nary ...
Frank Gurski +2 more
doaj +2 more sources
Heliyon, 2022 Topological invariants are numerical parameters of graphs or hypergraphs that indicate its topology and are known as graph or hypergraph invariants. In this paper, topological indices of hypergraphs such as Wiener index, degree distance index and Gutman ...
Sakina Ashraf +3 more
doaj +1 more source
Resolvability in Hypergraphs [PDF]
, 2023 This article presents an extension of the study of metric and partition dimension to hypergraphs. We give sharp lower bounds for the metric and partition dimension of hypergraphs in general and give exact values under specified ...
Javaid, Imran +3 more
core +4 more sources
Hypergraph and Uncertain Hypergraph Representation Learning Theory and Methods
Mathematics, 2022 With the advent of big data and the information age, the data magnitude of various complex networks is growing rapidly. Many real-life situations cannot be portrayed by ordinary networks, while hypergraphs have the ability to describe and characterize ...
Liyan Zhang +5 more
doaj +1 more source
Sharp Bounds on the Spectral Radii of Uniform Hypergraphs concerning Diameter or Clique Number
Discrete Dynamics in Nature and Society, 2021 In this paper, we defined two classes of hypergraphs, hyperbugs and kite hypergraphs. We show that balanced hyperbugs maximize the spectral radii of hypergraphs with fixed number of vertices and diameter and kite hypergraphs minimize the spectral radii ...
Qiannan Niu, Haizhen Ren, Lei Zhang
doaj +1 more source
On Clustering Detection Based on a Quadratic Program in Hypergraphs
Journal of Mathematics, 2022 A proper cluster is usually defined as maximally coherent groups from a set of objects using pairwise or more complicated similarities. In general hypergraphs, clustering problem refers to extraction of subhypergraphs with a higher internal density, for ...
Qingsong Tang
doaj +1 more source