<mods:mods version="3.0" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-0.xsd" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:mods="http://www.loc.gov/mods/v3"><mods:titleInfo><mods:title>Cordial Deficiency</mods:title></mods:titleInfo><mods:name type="personal"><mods:namePart type="given"> </mods:namePart><mods:namePart type="family">Riskin, Adrian</mods:namePart><mods:role><mods:roleTerm type="text">author</mods:roleTerm></mods:role></mods:name><mods:abstract>We introduce a new measure of the noncordiality of a graph and discuss a previously defined measure of the noncordiality of a graph. We then calculate the values of these measures for various families of noncordial graphs. We also determine exactly which of the Möbius ladders are cordial.</mods:abstract><mods:classification authority="lcc">Q Science, Computer Science</mods:classification><mods:originInfo><mods:dateIssued encoding="iso8061">2007</mods:dateIssued></mods:originInfo><mods:originInfo><mods:publisher>Penerbit Universiti Sains Malaysia</mods:publisher></mods:originInfo><mods:genre>Journal</mods:genre></mods:mods>