Algorithmic study on 2-transitivity of graphs

Let G=(V,E) be a graph where V and E are the vertex and edge sets, respectively. For two disjoint subsets A and B of V, we say AdominatesB if every vertex of B is adjacent to at least one vertex of A. A vertex partition π={V1,V2,…,Vk} of G is called a transitive partition of size k if Vi dominates V...

Full description

Bibliographic Details

Published in:	Discrete Applied Mathematics Vol. 358; pp. 57 - 75
Main Authors:	Paul, Subhabrata, Santra, Kamal
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 15.12.2024
Subjects:	2-transitivity Bipartite graphs Chordal graphs Linear-time algorithm NP-completeness Split graphs Split graphs 2-transitivity Chordal graphs Bipartite graphs NP-completeness Linear-time algorithm
ISSN:	0166-218X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!