A COHESION INDEX FOR COOPERATION GRAPHS

DOI10.1080/16073606.1993.9631735MaRDI QIDQ4288043zbMATH OpenOpenAlexFDO

Authors G. Geldenhuys

Publication date 21 April 1994

Published in Quaestiones Mathematicae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/16073606.1993.9631735

zbMATH Keywords

1-separationcomplete bipartite graphscooperation graphdominating setindex of cohesionlabelled graphscoretrees

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40)

Recommendations

• Publication:4733886
• On cohesion stable graphs
• scientific article; zbMATH DE number 6986952
• A fast exact algorithm for the problem of optimum cooperation and the structure of its solutions
• Graphs and Cooperation in Games

Cites work

• Cohesion and stability in graphs
• Graph theory with applications
• The cutting center theorem for trees

Cited in

(5)

• Ordering graphs in a normalized singular value measure
• A cooperation index based on the Rényi entropy of correlation matrix spectrum
• scientific article; zbMATH DE number 4120210 (Why is no real title available?)
• BRS-compactness in networks: Theoretical considerations related to cohesion in citation graphs, collaboration networks and the internet
• Coopetition bunch graphs: competition and cooperation on COVID19 research

This page was built for publication: A COHESION INDEX FOR COOPERATION GRAPHS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4288043)