Hiindex LOGO

Research Article

Bloom Graph


Author(s): D. Antony Xavier , Deeni C.J
Affiliation: Department of Mathematics,Loyola college,Chennai
Year of Publication: 2014
Source: International Journal of Computing Algorithm
     
×

Scholarly Article Identity Link


HTML:


File:


Citation: D. Antony Xavier, Deeni C.J. "Bloom Graph." International Journal of Computing Algorithm 3.1 (2014): 48-49.

Abstract:
Grid, cylinder and torus networks are immensely used Graph networks studied by specialists in dynamical systems and probability.In this paper, a new kind of graph, Bloom Graph [B(m,n)], have been proposed. It possessesa unique properly of being both regular and planar. We study some of its topological properties including its Hamiltonian property.


Keywords Interconnection network, Bloom graph, Planarity, Hamiltonicity.


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

@article{Blo1458344, author = {D. Antony Xavier,Deeni C.J}, title = {Bloom Graph}, journal={International Journal of Computing Algorithm}, volume={3}, issue={1}, issn = {2278-2397}, year = {2014}, publisher = {Scholarly Citation Index Analytics-SCIA}

  • [1] Mordecai J. Golin, Yiu Cho Leung, Yajun Wang, Xuerong Yong. Counting Structures in Grid Graphs, Cylinders and Tori Using Transfer Matrices: Survey and New Results., 2005.
  • [2] Alberto M. Teguia, Anant P. Godbole, Sierpinski Gasket Graph and some of their properties. 2005.
  • [3] AlonIta, Christos H. Papadimitriou, Jayma Luiz Szwarctfiter, Hamiltonian Paths in Grid Graph, Society of Industrial and Applied Mathematics, Vol 11, No 4, 1982.
  • [4] Junming Xu, Topological Structure and Analysis of Interconnection Networks, Kluwer Academic Publishers, 2001.
  • [5] Khuller S., Ragavachari B., Rosenfeld A., Landmarks in Graphs, Discrete Applied Mathematics, vol. 70, pages 217-229, 1996.
  • [6] Paul Manuel, BharatiRajan, IndraRajasingh, Chris Monica M., Landmarks in Torus Networks, Journal of Discrete Mathematical Sciences & Cryptography, vol. 9, pages 263-271, 2006.
  • [7] Paul Manuel, Mostafa I. Abd-El-Barr, IndraRajasingh and BharatiRajan, An Efficient Representation of Benes Networks and its Applications, Journal of Discrete Algorithms, vol. 6, pages 11-19, 2008.
  • [8] Stojmenovic I, Honeycomb Networks: Topological Properties and Communication Algorithms, IEEE Trans. Parallel and Distributed Systems, vol. 8, pages 1036-1042, 1997.
  • [9] R. S. Wilkov, Analysis and Design of Reliable Computer Networks, IEEE Trans. on Commun., vol. COM-20, pages 660-678, 1972.
  • [10] C. Wu and T. Y. Feng, On a Class of Multistage Interconnection Networks, IEEE Trans. on Comput., vol. C-29, pages. 694-702, 1980.
  • <?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>48</startPage> <endPage>49</endPage> <documentType>article</documentType> <title language='eng'>Bloom Graph</title> <authors> <author> <name>D. Antony Xavier</name> </author> </authors> <abstract language='eng'>Grid, cylinder and torus networks are immensely used Graph networks studied by specialists in dynamical systems and probability.In this paper, a new kind of graph, Bloom Graph [B(m,n)], have been proposed. It possessesa unique properly of being both regular and planar. We study some of its topological properties including its Hamiltonian property.</abstract> <fullTextUrl format='pdf'>http://www.hindex.org/2014/p583.pdf</fullTextUrl> <keywords language='eng'> <keyword>Interconnection network, Bloom graph, Planarity, Hamiltonicity.</keyword> </keywords> </record>

    { "@context":"http://schema.org", "@type":"publication-article","identifier":"http://www.hindex.org/2014/article.php?page=583", "name":"Bloom Graph", "author":[{"name":"D. Antony Xavier "}], "datePublished":"2014", "description":"Grid, cylinder and torus networks are immensely used Graph networks studied by specialists in dynamical systems and probability.In this paper, a new kind of graph, Bloom Graph [B(m,n)], have been proposed. It possessesa unique properly of being both regular and planar. We study some of its topological properties including its Hamiltonian property.", "keywords":["Interconnection network, Bloom graph, Planarity, Hamiltonicity."], "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>Deeni C.J</dc:contributor> <dc:contributor></dc:contributor> <dc:contributor></dc:contributor> <dc:creator>D. Antony Xavier</dc:creator> <dc:date>2014</dc:date> <dc:description>Grid, cylinder and torus networks are immensely used Graph networks studied by specialists in dynamical systems and probability.In this paper, a new kind of graph, Bloom Graph [B(m,n)], have been proposed. It possessesa unique properly of being both regular and planar. We study some of its topological properties including its Hamiltonian property.</dc:description> <dc:identifier>2014SCIA316F0583</dc:identifier> <dc:language>eng</dc:language> <dc:title>Bloom Graph</dc:title> <dc:type>publication-article</dc:type> </oai_dc:dc>

    { "identifier": "2014SCIA316F0583", "abstract": "Grid, cylinder and torus networks are immensely used Graph networks studied by specialists in dynamical systems and probability.In this paper, a new kind of graph, Bloom Graph [B(m,n)], have been proposed. It possessesa unique properly of being both regular and planar. We study some of its topological properties including its Hamiltonian property.", "author": [ { "family": "D. Antony Xavier,Deeni C.J" } ], "id": "583", "issued": { "date-parts": [ [ 2014 ] ] }, "language": "eng", "publisher": "Scholarly Citation Index Analytics-SCIA", "title": " Bloom Graph", "type": "publication-article", "version": "3" }