Algorithmic study of d₂-transitivity of graphs

DOI10.47443/DML.2023.178MaRDI QIDQ6561577zbMATH OpenFDO

Authors S. Paul, Kamal Santra

Publication date 25 June 2024

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

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.47443/DML.2023.178

zbMATH Keywords

\(d_2\)-transitivitybipartite graphslinear algorithmNP-completenesssplit graphs

Mathematics Subject Classification ID

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) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

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

Cites work

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

Cited in

(2)

• Algorithmic study on 2-transitivity of graphs
• On complementarily 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)