Independent restricted domination and the line digraph

MaRDI QIDQ1928631zbMATH OpenFDO

Authors Pietra Delgado-Escalante, Hortensia Galeana-Sánchez, Laura Pastrana Ramírez

Publication date 3 January 2013

Published in AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

inner arc-colorationline digraphrestricted dominationrestricted pathrestricted walk

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• Restricted domination in arc-colored digraphs
• Restricted domination in quasi-transitive and 3-quasi-transitive digraphs
• H-kernels by walks in an \(R_H (D)\) digraph
• \(H\)-kernels by walks in \(H\)-colored digraphs and the color-class digraph
• \(H\)-kernels and \(H\)-obstructions in \(H\)-colored digraphs

Cited in

(7)

• The underlying graph of a line digraph
• Independence number of iterated line digraphs
• Some conditions for the existence of Euler H-trails
• A generalization of properly colored paths and cycles in edge-colored graphs
• Trails in arc-colored digraphs avoiding forbidden transitions
• Euler dynamic H -trails in edge-colored graphs
• Dynamic cycles in edge-colored multigraphs

This page was built for publication: Independent restricted domination and the line digraph

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