Journal article icon

Journal article

Counting list matrix partitions of graphs

Abstract:

Given a symmetric D × D matrix M over {0, 1, ∗}, a list M-partition of a graph G is a partition of the vertices of G into D parts which are associated with the rows of M. The part of each vertex is chosen from a given list in such a way that no edge of G is mapped to a 0 in M and no non-edge of G is mapped to a 1 in M. Many important graph-theoretic structures can be represented as list M-partit...

Expand abstract
Publication status:
Accepted
Peer review status:
Peer reviewed

Actions


Authors


More by this author
Department:
Computer Science
Role:
Author
More by this author
Department:
Computer Science
Role:
Author
More by this author
Department:
Computer Science
Role:
Author
Engineering and Physical Sciences Research Council More from this funder
Ministry of Education, Culture, Sports, Science and Technology More from this funder
Publisher:
Society for Industrial and Applied Mathematics Publisher's website
Acceptance date:
2015-06-18
EISSN:
1095-7111
ISSN:
0097-5397
Language:
English
UUID:
uuid:78da0c0b-f364-4b9f-8ed3-d75941be23a1
Deposit date:
2015-06-19

Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP