Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

The complexity of social groups and social systems described by graph structures

From MaRDI portal
Publication:1166391
Jump to:navigation, search

DOI10.1016/0165-4896(80)90009-8zbMath0488.90006OpenAlexW2018834725MaRDI QIDQ1166391

Peter S. Albin

Publication date: 1980

Published in: Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0165-4896(80)90009-8


zbMATH Keywords

complexitysymmetric graphEulerian pathorganizational structuresgroup behaviorcommittee-subcommittee problemnode automatonranking of nondirected graphssocial group


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Group preferences (91B10) Applications of graph theory to circuits and networks (94C15)


Related Items (1)

The metalogic of economic predictions, calculations and propositions




Cites Work

  • Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item




This page was built for publication: The complexity of social groups and social systems described by graph structures

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1166391&oldid=13234785"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 04:58.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki