Ascending graphoidal tree cover for product graphs

DOI10.1080/09720529.2013.821332zbMATH Open1348.05164OpenAlexW2060948810MaRDI QIDQ2831093FDOQ2831093

V. Uma Maheswari, Anand Nagarajan

Publication date: 2 November 2016

Published in: Journal of Discrete Mathematical Sciences \& Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2013.821332

zbMATH Keywords

ascending coverascending graphoidal tree covergraphoidal tree cover

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Title not available (Why is that?)

Cited In (2)

• Restrained step triple connected domination number of a graph
• Title not available (Why is that?)

Recommendations

• On the \(k\)-path vertex cover of some graph products 👍 👎
• The \(k\)-path vertex cover of rooted product graphs 👍 👎
• Covering arrays on product graphs 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Ascending graphoidal tree cover for product graphs

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