Results 11 to 20 of about 11,127 (100)

Link Prediction with Hypergraphs via Network Embedding

open access: yesApplied Sciences, 2022
Network embedding is a promising field and is important for various network analysis tasks, such as link prediction, node classification, community detection and others.
Zijuan Zhao, Kai Yang, Jinli Guo
doaj   +1 more source

Generalized Hypergraph Coloring

open access: yesDiscussiones Mathematicae Graph Theory, 2021
A smooth hypergraph property 𝒫 is a class of hypergraphs that is hereditary and non-trivial, i.e., closed under induced subhypergraphs and it contains a non-empty hypergraph but not all hypergraphs.
Schweser Thomas
doaj   +1 more source

Concentric Plithogenic Hypergraph based on Plithogenic Hypersoft sets – A Novel Outlook [PDF]

open access: yesNeutrosophic Sets and Systems, 2020
Plithogenic Hypersoft sets (PHS) introduced by Smarandache are the extensions of soft sets and hypersoft sets and it was further protracted to plithogenic fuzzy whole Hypersoft set to make it more applicable to multi attribute decision making ...
Nivetha Martin , Florentin Smarandache
doaj   +1 more source

ON THE SPECTRA OF TENSOR JOIN OF HYPERGRAPHS [PDF]

open access: yesJournal of Algebraic Systems
In this paper, we consider certain classes of hypergraphs constructed from the tensor join of hypergraphs, specifically the tensor join of hypergraphs constrained by vertex subsets and the $(H, \mathcal{T}_{\mathcal{S}})$-join of hypergraphs constrained ...
Vishnupriya Ramkumar, Rajkumar Rajendran
doaj   +1 more source

Uniform hypergraphs containing no grids [PDF]

open access: yes, 2013
A hypergraph is called an r×r grid if it is isomorphic to a pattern of r horizontal and r vertical lines, i.e.,a family of sets {A1, ..., Ar, B1, ..., Br} such that Ai∩Aj=Bi∩Bj=φ for 1 ...
Füredi, Zoltán, Ruszinkó, Miklós
core   +1 more source

Diagonal Forms, Linear Algebraic Methods and Ramsey-Type Problems [PDF]

open access: yes, 2013
This thesis focuses mainly on linear algebraic aspects of combinatorics. Let N_t(H) be an incidence matrix with edges versus all subhypergraphs of a complete hypergraph that are isomorphic to H. Richard M.
Wong, Wing Hong Tony
core   +1 more source

An abstract approach to polychromatic coloring: Shallow hitting sets in ABA-free hypergraphs and pseudohalfplanes

open access: yesJournal of Computational Geometry, 2019
The goal of this paper is to give a new, abstract approach to cover-decomposition and polychromatic colorings using hypergraphs on ordered vertex sets.
Balázs Keszegh, Dömötör Pálvölgyi
doaj   +1 more source

Hypergraphs in m-Polar Fuzzy Environment

open access: yesMathematics, 2018
Fuzzy graph theory is a conceptual framework to study and analyze the units that are intensely or frequently connected in a network. It is used to study the mathematical structures of pairwise relations among objects. An m-polar fuzzy (mF, for short) set
Muhammad Akram, Gulfam Shahzadi
doaj   +1 more source

Elementary definability of the class of universal hypergraphic automata in the class of semigroups [PDF]

open access: yesИзвестия Саратовского университета. Новая серия: Математика. Механика. Информатика, 2022
Hypergraphic automata are automata, state sets and output symbol sets of which are hypergraphs, being invariant under actions of transition and output functions. Universally attracting objects in the category of hypergraphic automata are called universal
Molchanov, Vladimir Aleksandrovich   +1 more
doaj   +1 more source

Maximizing Spectral Radii of Uniform Hypergraphs with Few Edges

open access: yesDiscussiones Mathematicae Graph Theory, 2016
In this paper we investigate the hypergraphs whose spectral radii attain the maximum among all uniform hypergraphs with given number of edges. In particular we characterize the hypergraph(s) with maximum spectral radius over all unicyclic hypergraphs ...
Fan Yi-Zheng   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy