A mathematical approach on representation of competitions: competition cluster hypergraphs
From MaRDI portal
Publication:778654
DOI10.1155/2020/2517415zbMath1459.91148OpenAlexW3034368620WikidataQ125910195 ScholiaQ125910195MaRDI QIDQ778654
G. Muhiuddin, Abdulaziz M. Alanazi, Sovan Samanta, Kousik Das
Publication date: 3 July 2020
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2020/2517415
Social networks; opinion dynamics (91D30) Hypergraphs (05C65) Directed graphs (digraphs), tournaments (05C20)
Related Items (7)
Fuzzy chordal graphs and its properties ⋮ Concepts on coloring of cluster hypergraphs with application ⋮ New perspectives on classical meanness of some ladder graphs ⋮ Unnamed Item ⋮ Preservation of the classical meanness property of some graphs based on line graph operation ⋮ Reinforcement number of a graph with respect to half-domination ⋮ Distance two surjective labelling of paths and interval graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hermitian-adjacency matrices and Hermitian energies of mixed graphs
- The (1,2)-step competition graph of a tournament
- \(p\)-competition numbers
- Accessible single-valued neutrosophic graphs
- The number of independent sets in unicyclic graphs with a given diameter
- Line hypergraphs
- Infection in hypergraphs
- Tolerance competition graphs
- \(p\)-competition graphs
- Competition hypergraphs
- A characterization of cube-hypergraphs
- Sum numbers of hypertrees
- Judicious partitions of 3-uniform hypergraphs
- A new method to decision-making with fuzzy competition hypergraphs
- Distance-preserving subgraphs of hypercubes
- The competition number of a graph having exactly one hole
- Hamiltonian chains in hypergraphs
- On the Computation of the Competition Number of a Graph
- On derivable trees
- Vague hypergraphs
- Certain Algorithms for Computing Strength of Competition in Bipolar Fuzzy Graphs
- Fuzzy Hypergraphs and Related Extensions
- On the mixed adjacency matrix of a mixed graph
This page was built for publication: A mathematical approach on representation of competitions: competition cluster hypergraphs