Transitivity on subclasses of bipartite graphs

Subhabrata Paul () and Kamal Santra ()
Additional contact information
Subhabrata Paul: Indian Institute of Technology Patna
Kamal Santra: Indian Institute of Technology Patna

Journal of Combinatorial Optimization, 2023, vol. 45, issue 1, No 28, 16 pages

Abstract: Abstract Let $$G=(V, E)$$ G = ( V , E ) be a graph where V and E are the vertex and edge sets, respectively. For two disjoint subsets A and B, we say A dominates B if every vertex of B is adjacent to at least one vertex of A. A vertex partition $$\pi = \{V_1, V_2, \ldots , V_k\}$$ π = { V 1 , V 2 , … , V k } of G is called a transitive k-partition if $$V_i$$ V i dominates $$V_j$$ V j for all i, j where $$1\le i

Keywords: Transitivity; NP-completeness; Linear algorithm; Perfect elimination bipartite graphs; Bipartite chain graphs (search for similar items in EconPapers)
Date: 2023
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-022-00954-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:45:y:2023:i:1:d:10.1007_s10878-022-00954-y

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-022-00954-y

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().