An extension of regular colouring of graphs to digraphs, networks and hypergraphs

Martin G. Everett; Stephen P. Borgatti

doi:10.1016/0378-8733(93)90007-8

An extension of regular colouring of graphs to digraphs, networks and hypergraphs

Martin G. Everett, Stephen P. Borgatti

Management

Research output: Contribution to journal › Article › peer-review

15 Scopus citations

Abstract

The use of regular graph colouring as an equivalent simple definition for regular equivalence is extended from graphs to digraphs and networks. In addition new concepts of regular equivalence for edges and hypergraphs are presented using the new terminology.

Original language	English
Pages (from-to)	237-254
Number of pages	18
Journal	Social Networks
Volume	15
Issue number	3
DOIs	https://doi.org/10.1016/0378-8733(93)90007-8
State	Published - Sep 1993

ASJC Scopus subject areas

Anthropology
Sociology and Political Science
General Social Sciences
General Psychology

Access to Document

10.1016/0378-8733(93)90007-8

Cite this

@article{9f4a3f2d515e4903974ceddd3c1a1b51,

title = "An extension of regular colouring of graphs to digraphs, networks and hypergraphs",

abstract = "The use of regular graph colouring as an equivalent simple definition for regular equivalence is extended from graphs to digraphs and networks. In addition new concepts of regular equivalence for edges and hypergraphs are presented using the new terminology.",

author = "Everett, {Martin G.} and Borgatti, {Stephen P.}",

year = "1993",

month = sep,

doi = "10.1016/0378-8733(93)90007-8",

language = "English",

volume = "15",

pages = "237--254",

number = "3",

}

TY - JOUR

T1 - An extension of regular colouring of graphs to digraphs, networks and hypergraphs

AU - Everett, Martin G.

AU - Borgatti, Stephen P.

PY - 1993/9

Y1 - 1993/9

N2 - The use of regular graph colouring as an equivalent simple definition for regular equivalence is extended from graphs to digraphs and networks. In addition new concepts of regular equivalence for edges and hypergraphs are presented using the new terminology.

AB - The use of regular graph colouring as an equivalent simple definition for regular equivalence is extended from graphs to digraphs and networks. In addition new concepts of regular equivalence for edges and hypergraphs are presented using the new terminology.

UR - http://www.scopus.com/inward/record.url?scp=0007063357&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0007063357&partnerID=8YFLogxK

U2 - 10.1016/0378-8733(93)90007-8

DO - 10.1016/0378-8733(93)90007-8

M3 - Article

AN - SCOPUS:0007063357

SN - 0378-8733

VL - 15

SP - 237

EP - 254

JO - Social Networks

JF - Social Networks

IS - 3

ER -

An extension of regular colouring of graphs to digraphs, networks and hypergraphs

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this