文献知网节
  • 记笔记

An Optimized Algorithm to Determine The Eigenvalues From a Graphic Sequence by Constructing a Symmetric Matrix

Prantik BiswasAbhisek PaulParitosh Bhattacharya

Department of Computer Science and Engineering, National Institute of Technology

摘要:Spectral graph theory is a popular topic in modern day applied mathematics. Determining the eigenvalues of a given graph gives us an in-depth idea about some interesting properties of the graph. A finite sequence of nonnegative integers is said to be graphical if there exists a finite simple graph, such that the degrees of its vertices corresponds to the terms of the sequence. Such a graph is often termed as a realization of the given degree sequence. In this paper we have proposed an algorithm that determines the realization of a given degree sequence by constructing the adjacency matrix from the given sequence. Further we utilize the adjacency matrix thus obtained to determine the eigenvalues of the graph.
会议名称:

2015 2nd International Conference on World Islamic Studies

会议时间:

2015-03-08

会议地点:

Seoul, South Korea

  • 专辑:

    基础科学

  • 专题:

    数学

  • 分类号:

    O151.21

  • 手机阅读
    即刻使用手机阅读
    第一步

    扫描二维码下载

    "移动知网-全球学术快报"客户端

    第二步

    打开“全球学术快报”

    点击首页左上角的扫描图标

    第三步

    扫描二维码

    手机同步阅读本篇文献

  • HTML阅读
  • CAJ下载
  • PDF下载

下载手机APP用APP扫此码同步阅读该篇文章

下载:5 页码:44-48 页数:5 大小:788k

相关推荐
  • 相似文献
  • 读者推荐
  • 相关基金文献
  • 关联作者
  • 相关视频