Analysation Of Super Strongly Perfectness In Ladder Graphs

Mary Jothi

Source record

Source: Crossref

Published: Jan 1, 2013

DOI: 10.26634/jmat.2.2.2313

Open original source ↗

Source abstract

Using this characterization they have characterized the Super Strongly Perfect graphs in Ladder graphs. They have investigated the structure of Super Strongly Perfect Graphs in Ladder graphs. Also they have found the relation between domination number, co-domination number and diameter of Ladder Graphs.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.