Toll path domination in graphs

MaRDI QIDQ4607449zbMATH OpenFDO

Authors G. Narasimman, Km. Kathiresan

Publication date 13 March 2018

zbMATH Keywords

dominationtolled path

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Paths and cycles (05C38) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• On the toll number of a graph
• Toll number of the strong product of graphs
• Toll convexity
• Toll number of the Cartesian and the lexicographic product of graphs
• Computing the hull number in toll convexity

Cited in

(4)

• Tadpole domination number of graphs
• On the toll number of a graph
• Axiomatic characterization of the toll walk function of some graph classes
• A note on path domination

This page was built for publication: Toll path domination in graphs

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