Algorithmic study of d₂-transitivity of graphs

DOI10.47443/DML.2023.178MaRDI QIDQ6561577FDOQ6561577

Authors: S. Paul, Kamal Santra 

Publication date: 25 June 2024

Published in: DML. Discrete Mathematics Letters (Search for Journal in Brave)

Recommendations

• Algorithmic study on 2-transitivity of graphs
• Transitivity on subclasses of bipartite graphs
• Publication:4862104
• Transitivity of trees
• The upper domatic number of a graph

zbMATH Keywords

NP-completenessbipartite graphssplit graphslinear algorithm\(d_2\)-transitivity

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Some perfect coloring properties of graphs
• Towards a theory of domination in graphs
• Linear-time certifying recognition algorithms and forbidden induced subgraphs
• Results on the Grundy chromatic number of graphs
• Inequalities for the first-fit chromatic number
• Title not available (Why is that?)
• Title not available (Why is that?)
• On $k$-domatic numbers of graphs
• The domatic number problem
• Title not available (Why is that?)
• The transitivity of a graph
• The transitivity of special graph classes
• Iterated colorings of graphs.
• The upper domatic number of a graph
• Transitivity on subclasses of bipartite graphs
• A note on Grundy colorings of central graphs
• New results on upper domatic number of graphs

Cited In (1)

• Algorithmic study on 2-transitivity of graphs

This page was built for publication: Algorithmic study of \(d_2\)-transitivity of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6561577)