Strong transitivity of a graph

DOI10.1142/S1793830924500599MaRDI QIDQ6932349zbMATH OpenFDO

Authors S. Paul, Kamal Santra

Publication date 9 September 2025

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S1793830924500599

zbMATH Keywords

treesNP-completenesschordal graphssplit graphslinear-time algorithmstrong transitivity

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites work

• scientific article; zbMATH DE number 3663191 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (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?)
• A note on Grundy colorings of central graphs
• Inequalities for the first-fit chromatic number
• New results on upper domatic number of graphs
• On k-domatic numbers of graphs
• On the equality of the partial Grundy and upper ochromatic numbers of graphs
• Results on the Grundy chromatic number of graphs
• Some perfect coloring properties of graphs
• Strong weak domination and domination balance in a graph
• 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
• Towards a theory of domination in graphs
• Transitivity on subclasses of bipartite graphs
• Transitivity on subclasses of chordal graphs

Cited in

(1)

• On complementarily transitivity of graphs

This page was built for publication: Strong transitivity of a graph

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