<?xml version="1.0" encoding="UTF-8"?>
<record
    xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
    xsi:schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd"
    xmlns="http://www.loc.gov/MARC21/slim">

  <leader>03505nam a2200313 i 4500</leader>
  <controlfield tag="003">CSPC</controlfield>
  <controlfield tag="005">20260930155549.0</controlfield>
  <controlfield tag="008">260924s2025    ii a     b    001 0 eng d</controlfield>
  <datafield tag="020" ind1=" " ind2=" ">
    <subfield code="a">9789362249982</subfield>
  </datafield>
  <datafield tag="040" ind1=" " ind2=" ">
    <subfield code="a">CSPC</subfield>
    <subfield code="b">eng</subfield>
    <subfield code="c">CSPC</subfield>
    <subfield code="d">CSPC</subfield>
    <subfield code="e">rda</subfield>
  </datafield>
  <datafield tag="050" ind1="0" ind2="0">
    <subfield code="a">QA166</subfield>
    <subfield code="b">.F56 2025</subfield>
  </datafield>
  <datafield tag="082" ind1="0" ind2="0">
    <subfield code="a">511.5</subfield>
    <subfield code="b">F495</subfield>
    <subfield code="2">23</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="0">
    <subfield code="a">Finite graphs and networks / </subfield>
    <subfield code="c">edited by Aaditya Raj. </subfield>
  </datafield>
  <datafield tag="264" ind1=" " ind2="1">
    <subfield code="a">New Delhi, India : </subfield>
    <subfield code="b">Discovery Publishing House, </subfield>
    <subfield code="c">2025.</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
    <subfield code="a">viii, 210 pages : </subfield>
    <subfield code="b">illustrations ; </subfield>
    <subfield code="c">24 cm. </subfield>
  </datafield>
  <datafield tag="336" ind1=" " ind2=" ">
    <subfield code="2">rdacontent</subfield>
    <subfield code="a">text </subfield>
  </datafield>
  <datafield tag="337" ind1=" " ind2=" ">
    <subfield code="2">rdamedia</subfield>
    <subfield code="a">unmediated</subfield>
  </datafield>
  <datafield tag="338" ind1=" " ind2=" ">
    <subfield code="2">rdacarrier</subfield>
    <subfield code="a">volume</subfield>
  </datafield>
  <datafield tag="504" ind1=" " ind2=" ">
    <subfield code="a">Includes bibliographical references and index. </subfield>
  </datafield>
  <datafield tag="505" ind1="0" ind2=" ">
    <subfield code="a">Graph-theoretical analysis of biological networks: a survey -- The multi-maximum and quasi-maximum common subgraph problem -- Graph-based siamese network for authorship verification -- The symmetry and topology of finite and periodic graphs and their embeddings in three-dimensional euclidean space -- On the inverse symmetric division deg index of unicyclic graphs -- A conceptual graph-based method to compute information content -- Power graphs of finite cyclic groups -- Characterizing finite groups through equitable graphs: a graph-theoretic approach.  </subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">"Finite graphs and networks are fundamental structures that find widespread application across computer science, mathematics, and engineering, playing a pivotal role in modeling and solving real-world problems efficiently.
The practical utility of finite graphs and networks is augmented by the availability of various algorithms and mathematical techniques for their analysis. Graph theory, in particular, provides a rich set of tools for studying connectivity, shortest paths, network flows, and optimization problems. Algorithms based on graph theory are instrumental in solving complex computational problems efficiently, contributing to advancements in fields such as data science, machine learning, and artificial intelligence.
Finite Graphs and Networks provides a comprehensive introduction to the fundamental concepts and applications of finite graphs and networks. The book covers a wide range of topics, including basic graph theory, network analysis, and applications of graphs and networks in various fields such as computer science, engineering, and social sciences. It also deals with the study of network structures, including different types of networks and their properties. The book also covers algorithms for analyzing and manipulating graphs and networks, such as shortest path algorithms, spanning tree algorithms, and network flow algorithms. One of the main goals of the book is to provide readers with a solid understanding of how graphs and networks can be used to model and solve real-world problems. To achieve this, the book includes numerous examples and applications of graphs and networks in different fields. These include social networks, transportation networks, communication networks, and more. The book also discusses how graphs and networks can be used to model and analyze complex systems, such as the internet and biological networks"-- Back cover.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Graph theory.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Graphs (Mathematics).</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Networks (Mathematics).</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
    <subfield code="a">Finite graphs.</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
    <subfield code="a">Raj, Aaditya,</subfield>
    <subfield code="e">editor.</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
    <subfield code="2">ddc</subfield>
    <subfield code="n">0</subfield>
    <subfield code="c">BK</subfield>
    <subfield code="h">511.5</subfield>
    <subfield code="i">F495</subfield>
    <subfield code="k">CIR </subfield>
    <subfield code="m">2025</subfield>
    <subfield code="e">23</subfield>
  </datafield>
  <datafield tag="952" ind1=" " ind2=" ">
    <subfield code="0">0</subfield>
    <subfield code="1">0</subfield>
    <subfield code="2">ddc</subfield>
    <subfield code="4">0</subfield>
    <subfield code="7">0</subfield>
    <subfield code="a">CSPC</subfield>
    <subfield code="b">CSPC</subfield>
    <subfield code="c">CIR</subfield>
    <subfield code="d">2026-09-24</subfield>
    <subfield code="l">0</subfield>
    <subfield code="o">CIR 511.5 F495 2025</subfield>
    <subfield code="p">032536</subfield>
    <subfield code="r">2026-09-24 14:59:06</subfield>
    <subfield code="t">1-1</subfield>
    <subfield code="w">2026-09-24</subfield>
    <subfield code="y">BK</subfield>
  </datafield>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="c">33484</subfield>
    <subfield code="d">33484</subfield>
  </datafield>
</record>
