
<?xml version="1.0" encoding="UTF-8"?>
<record>
  <title>Isomorphism of Hypergraphs at an Efficient Clustering Model</title>
  <journal>International Journal of Web Applications</journal>
  <author>Vladislav Vasilev</author>
  <volume>14</volume>
  <issue>2</issue>
  <year>2022</year>
  <doi>https://doi.org/10.6025/ijwa/2022/14/2/35-41</doi>
  <url>https://www.dline.info/ijwa/fulltext/v14n2/ijwav14n2_2.pdf</url>
  <abstract>In the wireless sensor networks, the link and connectivity issues are major concern. To ensure perfect connectivity and problem-free system, is to use a robust and scalable system which is called as unsupervised learning. In this work, we have used an isomorphism of a particularly hypergraph to arrive at an efficient clustering model. We in this work further calculated the chromatic polynomial and created a chordal graph way.</abstract>
</record>
