Algorithmic study on 2-transitivity of graphs

DOI10.1016/J.DAM.2024.06.030MaRDI QIDQ6611052zbMATH OpenFDO

Authors S. Paul, Kamal Santra

Publication date 26 September 2024

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2024.06.030

zbMATH Keywords

NP-completenesschordal graphsbipartite graphssplit graphslinear-time algorithm2-transitivity

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Recommendations

• Algorithmic study of \(d_2\)-transitivity of graphs
• Transitivity on subclasses of bipartite graphs
• Transitivity of trees
• Publication:4862104
• The algorithmic complexity of \(k\)-domatic partition of graphs

Cites work

• scientific article; zbMATH DE number 3914370 (Why is no real title available?)
• scientific article; zbMATH DE number 3914371 (Why is no real title available?)
• scientific article; zbMATH DE number 3663191 (Why is no real title available?)
• scientific article; zbMATH DE number 731842 (Why is no real title available?)
• scientific article; zbMATH DE number 2147949 (Why is no real title available?)
• scientific article; zbMATH DE number 4121429 (Why is no real title available?)
• scientific article; zbMATH DE number 3800939 (Why is no real title available?)
• A note on Grundy colorings of central graphs
• Algorithmic aspects of the \(k\)-domination problem in graphs
• Incidence matrices and interval graphs
• Inequalities for the first-fit chromatic number
• Linear-time certifying recognition algorithms and forbidden induced subgraphs
• New results on upper domatic number of graphs
• On k-domatic numbers of graphs
• On a relationship between 2-dominating and 5-dominating sets in graphs
• Results on the Grundy chromatic number of graphs
• Some perfect coloring properties of graphs
• Structures of domination in graphs
• The domatic number problem
• The splittance of a graph
• The transitivity of a graph
• The transitivity of special graph classes
• The upper domatic number of a graph
• Topics in Domination in Graphs
• Towards a theory of domination in graphs
• Transitivity on subclasses of bipartite graphs
• Transitivity on subclasses of chordal graphs
• \(k\)-domination and \(k\)-independence in graphs: A survey

Cited in

(2)

• Algorithmic study of \(d_2\)-transitivity of graphs
• On complementarily transitivity of graphs

This page was built for publication: Algorithmic study on 2-transitivity of graphs

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