Results 101 to 110 of about 728,495 (209)

Built‐to‐Suit Telecoms Contractor Selection Using an Interval Type‐3 Fuzzy Analytic Hierarchy Process

Engineering Reports, Volume 8, Issue 9, September 2026.
Selecting build‐to‐suit telecom contractors is a high‐stakes decision shaped by vague expert judgments. This study develops an interval type‐3 fuzzy Analytic Hierarchy Process whose secondary credibility grade models uncertainty about the judgments themselves.
Leah‐Maria Ndokezi, Haryson Nyobuya
wiley   +1 more source

The Uniformity Space of Hypergraphs

, 2012
For a hypergraph H=(V,E) and a field F, a weighting of H is a map f:V ?F. A weighting is called stable if there is some k ? F such that the sum of the weights on each edge of H is equal to k.
Mol, Lucas
core  

Enumeration of Connected Uniform Hypergraphs

, 2005
In this paper, we are concerned in counting exactly and asymptotically connected labeled $b$-uniform hypergraphs ($b \geq 3$). Enumerative results on connected graphs are generalized here to connected uniform hypergraphs.
Ravelomanana, Vlady, Andriamampianina, Tsiriniaina   +1 more
core   +1 more source

Multimodal University Academic Performance Prediction Model Based on Heterogeneous Graph Neural Networks

Engineering Reports, Volume 8, Issue 9, September 2026.
The HGN‐MSP model addresses academic performance prediction challenges through multimodal graph learning with semantic alignment and modality balancing, achieving 0.896 AUC and 5.3% improvement over XGBoost in precisely identifying at‐risk students on a dataset of 19,856 students.
Jun Fan, Bin Chen, Byungwon Min, Tao Xie
wiley   +1 more source

Chromatic Polynomials Of Some (m,l)-Hyperwheels [PDF]

Computer Science Journal of Moldova, 2014
In this paper, using a standard method of computing the chromatic polynomial of hypergraphs, we introduce a new reduction theorem which allows us to find explicit formulae for the chromatic polynomials of some (complete) non-uniform $(m,l)-$hyperwheels ...
Julian A. Allagan
doaj  

On Tight Tree‐Complete Hypergraph Ramsey Numbers

Journal of Graph Theory, Volume 113, Issue 1, Page 88-96, September 2026.
ABSTRACT Chvátal showed that for any tree T with k edges, the Ramsey number R ( T , n ) = k ( n − 1 ) + 1. For r = 3 or 4, we show that, if T is an r‐uniform nontrivial tight tree, then the hypergraph Ramsey number R ( T , n ) = Θ ( n r − 1 ). The 3‐uniform result comes from observing a construction of Cooper and Mubayi.
Jiaxi Nie
wiley   +1 more source

Regular subgraphs of uniform hypergraphs

Journal of Combinatorial Theory, Series B, 2016
We prove that for every integer $r\geq 2$, an $n$-vertex $k$-uniform hypergraph $H$ containing no $r$-regular subgraphs has at most $(1+o(1)){{n-1}\choose{k-1}}$ edges if $k\geq r+1$ and $n$ is sufficiently large. Moreover, if $r\in\{3,4\}$, $r\mid k$ and $k,n$ are both sufficiently large, then the maximum number of edges in an $n$-vertex $k$-uniform ...
openaire   +5 more sources

A Vulnerability Measure of k-Uniform Linear Hypergraphs

, 2023
Vulnerability refers to the ability of a network to continue functioning when part of the network is either naturally damaged or targeted for attack. In this paper, the rupture degree of graphs is employed to measure the vulnerability of uniform linear ...
Yinkui Li, Haixing Zhao, Ning Zhao
core   +1 more source

Independence in 5-uniform hypergraphs

Discrete Mathematics, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alex Eustis, Michael A. Henning, Anders Yeo   +2 more
openaire   +2 more sources

On judicious partitions of uniform hypergraphs

Journal of Combinatorial Theory, Series A, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jianfeng Hou, Shufei Wu, Guiying Yan
openaire   +2 more sources