A mathematical approach on representation of competitions: competition cluster hypergraphs
DOI10.1155/2020/2517415zbMATH Open1459.91148OpenAlexW3034368620WikidataQ125910195 ScholiaQ125910195MaRDI QIDQ778654FDOQ778654
Authors: Sovan Samanta, G. Muhiuddin, Abdulaziz M. Alanazi, 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
Recommendations
- Competition graphs and clique dimensions
- scientific article; zbMATH DE number 3912431
- Characterizations of competition multigraphs
- Competition hypergraphs
- scientific article; zbMATH DE number 6009
- \(p\)-competition graphs
- Competition numbers and phylogeny numbers of connected graphs and hypergraphs
- An upper bound for the competition numbers of graphs
- \((i,j)\) competition graphs
- The (1, 2)-step competition graph of a hypertournament
Directed graphs (digraphs), tournaments (05C20) Social networks; opinion dynamics (91D30) Hypergraphs (05C65)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The (1,2)-step competition graph of a tournament
- Hamiltonian chains in hypergraphs
- Distance-preserving subgraphs of hypercubes
- Title not available (Why is that?)
- Judicious partitions of 3-uniform hypergraphs
- Tolerance competition graphs
- \(p\)-competition graphs
- Competition hypergraphs
- Vague hypergraphs
- On the Computation of the Competition Number of a Graph
- The competition number of a graph having exactly one hole
- Hermitian-adjacency matrices and Hermitian energies of mixed graphs
- The number of independent sets in unicyclic graphs with a given diameter
- \(p\)-competition numbers
- Accessible single-valued neutrosophic graphs
- Line hypergraphs
- Infection in hypergraphs
- A characterization of cube-hypergraphs
- Sum numbers of hypertrees
- A new method to decision-making with fuzzy competition hypergraphs
- Extremal \(k\)-edge-Hamiltonian hypergraphs
- Title not available (Why is that?)
- On derivable trees
- Certain algorithms for computing strength of competition in bipolar fuzzy graphs
- Fuzzy hypergraphs and related extensions
- Title not available (Why is that?)
- On the mixed adjacency matrix of a mixed graph
Cited In (8)
- New perspectives on classical meanness of some ladder graphs
- Concepts on coloring of cluster hypergraphs with application
- 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
- Poset properties with respect to semi-ideal based zero-divisor graph
- Title not available (Why is that?)
- Fuzzy chordal graphs and its properties
This page was built for publication: A mathematical approach on representation of competitions: competition cluster hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q778654)
