A COHESION INDEX FOR COOPERATION GRAPHS

DOI10.1080/16073606.1993.9631735zbMATH Open0794.05060OpenAlexW1986994469MaRDI QIDQ4288043FDOQ4288043

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

treesscoredominating setcomplete bipartite graphslabelled graph1-separationcooperation graphindex of cohesion

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• The cutting center theorem for trees
• Cohesion and stability in graphs

Cited In (1)

• BRS-compactness in networks: Theoretical considerations related to cohesion in citation graphs, collaboration networks and the internet

   Recommendations

• Title not available (Why is that?) 👍 👎
• On cohesion stable graphs 👍 👎
• Title not available (Why is that?) 👍 👎
• A fast exact algorithm for the problem of optimum cooperation and the structure of its solutions 👍 👎
• Graphs and Cooperation in Games 👍 👎

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)