Algebraic approach to fasciagraphs and rotagraphs

DOI10.1016/0166-218X(95)00058-YzbMath0848.05038OpenAlexW2000865051MaRDI QIDQ1917348

Janez Žerovnik, Sandi Klavžar

Publication date: 1 October 1996

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

Full work available at URL: https://doi.org/10.1016/0166-218x(95)00058-y

zbMATH Keywords

domination numberfasciagraphpolygraphrotagraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (18)

Total domination number of grid graphs ⋮ A constant time algorithm for some optimization problems in rotagraphs and fasciagraphs ⋮ On domination numbers of graphs bundles ⋮ On the 2-domination Number of Cylinders with Small Cycles ⋮ A generalization of the pentomino exclusion problem: dislocation of graphs ⋮ Critical cyclic patterns related to the domination number of the torus ⋮ Identifying codes in some subgraphs of the square lattice ⋮ Distance-related invariants on polygraphs ⋮ The 2-domination number of cylindrical graphs ⋮ Independent rainbow domination of graphs ⋮ Hosoya index of thorny polymers ⋮ On the 2-rainbow independent domination numbers of some graphs ⋮ Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers ⋮ Generic algorithms for some decision problems on fasciagraphs and rotagraphs ⋮ Domination of generalized Cartesian products ⋮ \(L(2,1)\)-labeling of direct product of paths and cycles ⋮ A general lower bound for the domination number of cylindrical graphs ⋮ Domination number of the cross product of paths

Cites Work

• Introduction to ``Topics on Domination
• Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
• The matching polynomial of a polygraph
• Linear and combinatorial optimization in ordered algebraic structures
• Unit disk graphs
• Semirings and path spaces
• Dominating Cartesian products of cycles
• On the domination of the products of graphs II: Trees
• Graph minors. II. Algorithmic aspects of tree-width
• The domination numbers of the 5 × n and 6 × n grid graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algebraic approach to fasciagraphs and rotagraphs