A mathematical approach on representation of competitions: competition cluster hypergraphs

DOI10.1155/2020/2517415MaRDI QIDQ778654zbMATH OpenOpenAlexWikidataFDO

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)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2020/2517415

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Social networks; opinion dynamics (91D30) Hypergraphs (05C65)

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

Cites work

• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• scientific article; zbMATH DE number 43754 (Why is no real title available?)
• scientific article; zbMATH DE number 3545685 (Why is no real title available?)
• scientific article; zbMATH DE number 3566474 (Why is no real title available?)
• scientific article; zbMATH DE number 3606214 (Why is no real title available?)
• scientific article; zbMATH DE number 3317677 (Why is no real title available?)
• A characterization of cube-hypergraphs
• A new method to decision-making with fuzzy competition hypergraphs
• Accessible single-valued neutrosophic graphs
• Certain algorithms for computing strength of competition in bipolar fuzzy graphs
• Competition hypergraphs
• Distance-preserving subgraphs of hypercubes
• Extremal \(k\)-edge-Hamiltonian hypergraphs
• Fuzzy hypergraphs and related extensions
• Hamiltonian chains in hypergraphs
• Hermitian-adjacency matrices and Hermitian energies of mixed graphs
• Infection in hypergraphs
• Judicious partitions of 3-uniform hypergraphs
• Line hypergraphs
• On derivable trees
• On the Computation of the Competition Number of a Graph
• On the mixed adjacency matrix of a mixed graph
• Sum numbers of hypertrees
• The (1,2)-step competition graph of a tournament
• The competition number of a graph having exactly one hole
• The number of independent sets in unicyclic graphs with a given diameter
• Tolerance competition graphs
• Vague hypergraphs
• \(p\)-competition graphs
• p-competition numbers

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
• scientific article; zbMATH DE number 3860948 (Why is no real title available?)
• 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)