<mets:mets LABEL="Eprints Item" xsi:schemaLocation="http://www.loc.gov/METS/ http://www.loc.gov/standards/mets/mets.xsd http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-0.xsd" xmlns:xlink="http://www.w3.org/1999/xlink" OBJID="oai:myais.fsktm.um.edu.my:1460" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:mods="http://www.loc.gov/mods/v3" xmlns:mets="http://www.loc.gov/METS/"><mets:metsHdr CREATEDATA="2009-01-09T03:43:33Z"><mets:agent TYPE="ORGANIZATION" ROLE="CUSTODIAN"><mets:name>Malaysian Abstracting and Indexing System</mets:name></mets:agent></mets:metsHdr><mets:dmdSec ID="DMD_oai:myais.fsktm.um.edu.my:1460_mods"><mets:mdWrap MDTYPE="mods"><mets:xmlData><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></mets:xmlData></mets:mdWrap></mets:dmdSec><mets:amdSec ID="TMD_oai:myais.fsktm.um.edu.my:1460"><mets:rightsMD ID="rights_oai:myais.fsktm.um.edu.my:1460_mods"><mets:mdWrap MDTYPE="mods"><mets:xmlData><mods:useAndReproduction>
<p><strong>For work being deposited by its own author:</strong> 
In self-archiving this collection of files and associated bibliographic 
metadata, I grant Malaysian Abstracting and Indexing System the right to store 
them and to make them permanently available publicly for free on-line. 
I declare that this material is my own intellectual property and I 
understand that Malaysian Abstracting and Indexing System does not assume any 
responsibility if there is any breach of copyright in distributing these 
files or metadata. (All authors are urged to prominently assert their 
copyright on the title page of their work.)</p>

<p><strong>For work being deposited by someone other than its 
author:</strong> I hereby declare that the collection of files and 
associated bibliographic metadata that I am archiving at 
Malaysian Abstracting and Indexing System) is in the public domain. If this is 
not the case, I accept full responsibility for any breach of copyright 
that distributing these files or metadata may entail.</p>

<p>Clicking on the deposit button indicates your agreement to these 
terms.</p>
    </mods:useAndReproduction></mets:xmlData></mets:mdWrap></mets:rightsMD></mets:amdSec><mets:fileSec></mets:fileSec><mets:structMap><mets:div AMDID="TMD_oai:myais.fsktm.um.edu.my:1460" DMDID="DMD_oai:myais.fsktm.um.edu.my:1460_mods"></mets:div></mets:structMap></mets:mets>