Hiindex LOGO

Research Article

Chordal Graphs And Their Clique Graphs


Author(s): J.Arockia Aruldoss , P.Kalaivani
Affiliation: PG&Research Department Of Mathematics, St. Joseph’s College, Cuddalore, Tamilnadu, India E-mail: aruligori@gmail.com
Year of Publication: 2014
Source: International Journal of Computing Algorithm
     
×

Scholarly Article Identity Link


HTML:


File:


Citation: J.Arockia Aruldoss, P.Kalaivani. "Chordal Graphs And Their Clique Graphs." International Journal of Computing Algorithm 3.3 (2014): 236-239.

Abstract:
In this paper, we present a new structure for chordal graph. We have also given the algorithm for MCSMaximal Cardinality Search and lexicographic BFSBreadth First Search which is used in two linear time and space algorithm. Also we discuss how to build a clique tree of a chordal graph and the other is simple recognition procedure of chordal graphs.


Keywords Chordal graph, MCS, Clique graph, BFS.


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

@article{Cho1484722, author = {J.Arockia Aruldoss,P.Kalaivani}, title = {Chordal Graphs And Their Clique Graphs}, journal={International Journal of Computing Algorithm}, volume={3}, issue={3}, issn = {2278-2397}, year = {2014}, publisher = {Scholarly Citation Index Analytics-SCIA}

  • [1] Beeri, R.Fagin, D.Maier, and M.Yannakakis.On the desireability of acyclic database and schemes.J.Assoc.Comput.,30:479-513,1983.
  • [2] C.Berge.Hypergraphs.North Hollands,1989. J.R.S. Blair and B.Peyton. An introduction to chordal graphs and clique trees.preprint.
  • [3] Brandstadt, F.F.Dragan,V.D.Chepoi, and V.I.Voloshin. Dually chordal graphs. In proceedings of the 19 thInter.Workshop on Graph-TheoreticConcept in Computer Science,1993.WG93.
  • [4] PBuneman.A characterization of rigid circuit graphs. Discrete Math.,9:205-212,1974.
  • [5] Dahlhaus,P.L.Hammer,F.Maffray,andS.Olariu.On domination elimination orderings and domination graphs.Technical Report 27-94,Rutgers University Centre of Operations Research,P.O.Box 5062,New Brunswick,NewJersey,USA,August 1994.
  • [6] A.Dirac. On rigid circuit graphs.Abh.Math.Sem.Uni.Hamburg 25,1961.
  • [7] Gavril.The intersection graphs of a path in a tree are exactly the chordal graphs.Journ.Comb.Theory,16:47-56,1974.
  • [8] yan B.Hayward. Weakly triangulated graphs. Journal of Combinatorial theory,39:200-209,1985.Serie B
  • [9] Krote, L.Lovasz, and R.Schrader. Greedoids. Number 4 in the algorithms and Combinatories.Springer Verlag,1991.
  • [10] G.Lewis,B.W.Peyton, and A.Pothen.A fast algorithm for reordering sparse matrices for parallel factorization. SIAM J.Sci.Stat.Comput.,106:1146-1173,November 1989.
  • [11] Olariu. Some aspects of the semi-perfect elimination.Discrete Applied Mathematics,31:291-298,1991.
  • <?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>3</issue> <startPage>236</startPage> <endPage>239</endPage> <documentType>article</documentType> <title language='eng'>Chordal Graphs And Their Clique Graphs</title> <authors> <author> <name>J.Arockia Aruldoss</name> </author> </authors> <abstract language='eng'>In this paper, we present a new structure for chordal graph. We have also given the algorithm for MCSMaximal Cardinality Search and lexicographic BFSBreadth First Search which is used in two linear time and space algorithm. Also we discuss how to build a clique tree of a chordal graph and the other is simple recognition procedure of chordal graphs.</abstract> <fullTextUrl format='pdf'>http://www.hindex.org/2014/p847.pdf</fullTextUrl> <keywords language='eng'> <keyword>Chordal graph, MCS, Clique graph, BFS.</keyword> </keywords> </record>

    { "@context":"http://schema.org", "@type":"publication-article","identifier":"http://www.hindex.org/2014/article.php?page=847", "name":"Chordal Graphs And Their Clique Graphs", "author":[{"name":"J.Arockia Aruldoss "}], "datePublished":"2014", "description":"In this paper, we present a new structure for chordal graph. We have also given the algorithm for MCSMaximal Cardinality Search and lexicographic BFSBreadth First Search which is used in two linear time and space algorithm. Also we discuss how to build a clique tree of a chordal graph and the other is simple recognition procedure of chordal graphs.", "keywords":["Chordal graph, MCS, Clique graph, BFS."], "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>P.Kalaivani</dc:contributor> <dc:contributor></dc:contributor> <dc:contributor></dc:contributor> <dc:creator>J.Arockia Aruldoss</dc:creator> <dc:date>2014</dc:date> <dc:description>In this paper, we present a new structure for chordal graph. We have also given the algorithm for MCSMaximal Cardinality Search and lexicographic BFSBreadth First Search which is used in two linear time and space algorithm. Also we discuss how to build a clique tree of a chordal graph and the other is simple recognition procedure of chordal graphs.</dc:description> <dc:identifier>2014SCIA316F0847</dc:identifier> <dc:language>eng</dc:language> <dc:title>Chordal Graphs And Their Clique Graphs</dc:title> <dc:type>publication-article</dc:type> </oai_dc:dc>

    { "identifier": "2014SCIA316F0847", "abstract": "In this paper, we present a new structure for chordal graph. We have also given the algorithm for MCSMaximal Cardinality Search and lexicographic BFSBreadth First Search which is used in two linear time and space algorithm. Also we discuss how to build a clique tree of a chordal graph and the other is simple recognition procedure of chordal graphs.", "author": [ { "family": "J.Arockia Aruldoss,P.Kalaivani" } ], "id": "847", "issued": { "date-parts": [ [ 2014 ] ] }, "language": "eng", "publisher": "Scholarly Citation Index Analytics-SCIA", "title": " Chordal Graphs And Their Clique Graphs", "type": "publication-article", "version": "3" }