Hiindex LOGO

Research Article

Conditional Matching Preclusion Number of Certain Graphs


Author(s): D. Antony Xavier , S.Maria Jesu Raja
Affiliation: Department of Mathematics,Loyola college,Chennai
Year of Publication: 2014
Source: International Journal of Computing Algorithm
     
×

Scholarly Article Identity Link


HTML:

<a href="http://www.hindex.org/2014/article.php?page=584"><img src="http://www.hindex.org/sai.php/2014SCIA316F0584" alt="SAI"></a>


File:

http://www.hindex.org/2014/p584.pdf


Citation: D. Antony Xavier, S.Maria Jesu Raja. "Conditional Matching Preclusion Number of Certain Graphs." International Journal of Computing Algorithm 3.1 (2014): 50-53.

Abstract:
The matching preclusion number of a graph is the minimum number of neither edges whose deletion in a graph has a neither perfect matching nor an almost perfect matching. For many interconnection networks, the optimal sets are precisely those induced by a single vertex. Recently the conditional matching preclusion number of a graph was introduced to look for sets beyond those induced by a single vertex. It is defined to be the minimum number of edges whose deletion results in a graph with no isolated vertices and has neither a perfect matching nor almost perfect matching.


Keywords Conditional Matching Preclusion Number, Triangular Ladder, Cn with Parallel Chords, Trampoline Graph, Diamond Snake Graph and K- Polygonal Snake Graph.


  • BibTex
  • Reference
  • XML
  • JSON
  • Dublin Core
  • CSL

@article{Con1458455, author = {D. Antony Xavier,S.Maria Jesu Raja}, title = {Conditional Matching Preclusion Number of Certain Graphs}, journal={International Journal of Computing Algorithm}, volume={3}, issue={1}, issn = {2278-2397}, year = {2014}, publisher = {Scholarly Citation Index Analytics-SCIA}

  • [1] R.C. Brigham, F. Harary, E.C. Violin and J. Yellan, “Perfect matching preclusion”, CongressusNumerantium, Vol 174, pages 185-192, 2005.
  • [2] E. Cheng, R. Jiao and D.Lu.“Matching preclusion and conditional matching preclusion for augmented cubes”, Journal of Interconnection Networks, Vol 11, pages35-60, 2010.
  • [3] E. Cheng, L. Lesniak, M.J. Lipman and L. liptak, “Matching preclusion for alternating group graphs and their generalizations”, International Journal of Foundations Computer Science, Vol 19, pages1413-1437, 2008.
  • [4] E. Cheng, L. Lesniak, M.J. Lipman and L. Liptak, “Conditional matching preclusion sets”, Information Science, Vol 179, 1092-1011, 2009.
  • [5] E. Cheng, M.J. Lipman, L. Liptak and D. Sherman, “Conditional matching preclusion for the arrangement graphs”, Theoretical Computer Science, Vol 412, pages 6279-6289, 2011.
  • [6] E. Cheng and L. Liptak, “Matching preclusion and Conditional matching preclusion problem for tori and related Cartesian products”, Discrete Applied Mathematics, Vol 160, pages1699-1716, 2012.
  • [7] E.Cheng, M.J. Lipman, L.Liptak and dM.Toeniskoetter, “Conditional matching preclusion for the alternating group graphs and spilt-stars”, International Journal of Computer Mathematics, Vol 88, pages 1120- 1136, 2011.
  • [8] J.H. Park and S.H. son, “Conditional matching preclusion for hypercube like interconnection network”, Theoretical computer Science, Vol 410, pages 2632-2640, 2009.
  • [9] S. Wang, R. wang, S. Lin and J.Li, “Matching preclusion for k-ary ncubes”, Discrete Applied Mathematics, Vol 158, pages 2066-2070, 2010.
  • [10] E. Cheng, P.Hu, R. jia, L.Liptak, “Matching preclusion and conditional matching preclusion problem for bipartite interconnection networks I: sufficient conditions”, Networks, 2012.
  • [11] R. Bhasker, E. Cheng, M. Liang, S. Pandey and K. Wang, “Matching preclusion and condition matching preclusion problem for Twisted cubes”, CongressusNumerantium, Vol 205, pages 175-185, 2010.
  • [12] S.J. Cyvin, I.Gutman, “kekule structures in Benzenoid Hydrocarbons”, Springer, Berlin, 1998.
  • [13] F. Kardos, D. Kral, J. Miskuf and J.Sereni, “Fullerene graphs have exponentially many perfect matchings”, Journal of Mathematical Chemistry, Vol 46, pages 443-447, 2009.
  • [14] D. Vukicevic and N. Trinajstic, “On the anti-kekule number and antiforcing number of cata-condensed benzenoids”, Journal of mathematical chemistry, Vol 43, 2008.
  • [15] D.Veljan and D. Vukicevic, “The anti-Kekule number of the infinite triangular, rectangular and hexagonal grids”, Glas, mate.Vol 43, pages 719-726, 2008.
  • [16] D. Vukicevic and N. Trinajstic, “On the anti-Kekule number and antiforcing number of cata-condensed benzenoids”, J. Math. Chem., Vol 43, pages 719-726, 2008.
  • [17] Q. Yang, D. Ye and H. Zhang, “On the Anti- Kekule Number of Fullerences”, MATCH Communications in Mathematical and in Computer chemistry, Vol 67, pages281-288, 2012.
  • [18] Q. Zhang, H. Bian and E. Vumar, “On the Anti-Kekule and Anti-Forcing Number of cata-condensed phenylenes”, MATCH Communication in Mathematical and in Computer Chemistry, Vol 65, pages 799-806, 2011.
  • [19] A. solairju and k chithra, “Edge- odd Grace full labeling of graphs”, proceeding of the international conference on mathematics and computer science, Vol 1, Jan-2009.
  • [20] Indrarajasingh ,Bharatirajan and V. Annamma, “Strongly multiplicative and strong by graphs”, Proceeding of the international conference on mathematics and computer science, Vol 1, mar-2007.
  • [21] Indrarajasingh, Bharatirajan and Florence Isido, “Partition into triangles”, proceeding of the international conference on mathematics and computer science, Vol 1, mar-2007.
  • [22] P. Jeyanthi and P. Selvagopal, “On Ck-super magic graphs”, proceeding of the international conference on mathematics and computer science, Vol 1, mar-2007.

  • <?xml version='1.0' encoding='UTF-8'?> <record> <language>eng</language> <journalTitle>International Journal of Computing Algorithm</journalTitle> <eissn>2278-2397 </eissn> <publicationDate>2014</publicationDate> <volume>3</volume> <issue>1</issue> <startPage>50</startPage> <endPage>53</endPage> <documentType>article</documentType> <title language='eng'>Conditional Matching Preclusion Number of Certain Graphs</title> <authors> <author> <name>D. Antony Xavier</name> </author> </authors> <abstract language='eng'>The matching preclusion number of a graph is the minimum number of neither edges whose deletion in a graph has a neither perfect matching nor an almost perfect matching. For many interconnection networks, the optimal sets are precisely those induced by a single vertex. Recently the conditional matching preclusion number of a graph was introduced to look for sets beyond those induced by a single vertex. It is defined to be the minimum number of edges whose deletion results in a graph with no isolated vertices and has neither a perfect matching nor almost perfect matching.</abstract> <fullTextUrl format='pdf'>http://www.hindex.org/2014/p584.pdf</fullTextUrl> <keywords language='eng'> <keyword>Conditional Matching Preclusion Number, Triangular Ladder, Cn with Parallel Chords, Trampoline Graph, Diamond Snake Graph and K- Polygonal Snake Graph.</keyword> </keywords> </record>

    { "@context":"http://schema.org", "@type":"publication-article","identifier":"http://www.hindex.org/2014/article.php?page=584", "name":"Conditional Matching Preclusion Number of Certain Graphs", "author":[{"name":"D. Antony Xavier "}], "datePublished":"2014", "description":"The matching preclusion number of a graph is the minimum number of neither edges whose deletion in a graph has a neither perfect matching nor an almost perfect matching. For many interconnection networks, the optimal sets are precisely those induced by a single vertex. Recently the conditional matching preclusion number of a graph was introduced to look for sets beyond those induced by a single vertex. It is defined to be the minimum number of edges whose deletion results in a graph with no isolated vertices and has neither a perfect matching nor almost perfect matching.", "keywords":["Conditional Matching Preclusion Number, Triangular Ladder, Cn with Parallel Chords, Trampoline Graph, Diamond Snake Graph and K- Polygonal Snake Graph."], "schemaVersion":"https://schema.org/version/3.3", "includedInDataCatalog":{ "@type":"DataCatalog", "name":"Scholarly Citation Index Analytics-SCIA", "url":"http://hindex.org"}, "publisher":{"@type":"Organization", "name":"Scientific Communications Research Academy" } }

    <?xml version='1.0' encoding='utf-8'?> <oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd"> <dc:contributor>S.Maria Jesu Raja</dc:contributor> <dc:contributor></dc:contributor> <dc:contributor></dc:contributor> <dc:creator>D. Antony Xavier</dc:creator> <dc:date>2014</dc:date> <dc:description>The matching preclusion number of a graph is the minimum number of neither edges whose deletion in a graph has a neither perfect matching nor an almost perfect matching. For many interconnection networks, the optimal sets are precisely those induced by a single vertex. Recently the conditional matching preclusion number of a graph was introduced to look for sets beyond those induced by a single vertex. It is defined to be the minimum number of edges whose deletion results in a graph with no isolated vertices and has neither a perfect matching nor almost perfect matching.</dc:description> <dc:identifier>2014SCIA316F0584</dc:identifier> <dc:language>eng</dc:language> <dc:title>Conditional Matching Preclusion Number of Certain Graphs</dc:title> <dc:type>publication-article</dc:type> </oai_dc:dc>

    { "identifier": "2014SCIA316F0584", "abstract": "The matching preclusion number of a graph is the minimum number of neither edges whose deletion in a graph has a neither perfect matching nor an almost perfect matching. For many interconnection networks, the optimal sets are precisely those induced by a single vertex. Recently the conditional matching preclusion number of a graph was introduced to look for sets beyond those induced by a single vertex. It is defined to be the minimum number of edges whose deletion results in a graph with no isolated vertices and has neither a perfect matching nor almost perfect matching.", "author": [ { "family": "D. Antony Xavier,S.Maria Jesu Raja" } ], "id": "584", "issued": { "date-parts": [ [ 2014 ] ] }, "language": "eng", "publisher": "Scholarly Citation Index Analytics-SCIA", "title": " Conditional Matching Preclusion Number of Certain Graphs", "type": "publication-article", "version": "3" }