A COHESION INDEX FOR COOPERATION GRAPHS

DOI10.1080/16073606.1993.9631735zbMATH Open0794.05060OpenAlexW1986994469MaRDI QIDQ4288043FDOQ4288043

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

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

zbMATH Keywords

treesscoredominating setcomplete bipartite graphslabelled graph1-separationcooperation graphindex of cohesion

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• Title not available (Why is that?)
• BRS-compactness in networks: Theoretical considerations related to cohesion in citation graphs, collaboration networks and the internet
• A cooperation index based on the Rényi entropy of correlation matrix spectrum
• Ordering graphs in a normalized singular value measure

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)