亚洲免费av电影一区二区三区,日韩爱爱视频,51精品视频一区二区三区,91视频爱爱,日韩欧美在线播放视频,中文字幕少妇AV,亚洲电影中文字幕,久久久久亚洲av成人网址,久久综合视频网站,国产在线不卡免费播放

        ?

        The least eigenvalue of the graph

        2023-01-03 07:48:04GaoRunxiaYuGuidongCaiGaixiang
        純粹數學與應用數學 2022年4期

        Gao RunxiaYu GuidongCai Gaixiang

        (1.Department of Social Undertakings,Anqing Vocational and Technical College,Anqing 246133,China;2.School of Mathematics and Physics,Anqing Normal University,Anqing 246133,China)

        Abstract:Let G be a simple graph.The adjacency matrix is denoted by G.The least eigenvalue of A(G),denoted by λmin(G),is called the least eigenvalue of G.In this paper we first establish the relations between the number of edges and the least eigenvalue of the adjacency matrix of the graph,and then give some spectral conditions for a graph having Hamiltonian paths or Hamiltonian cycles,or being Hamilton-connected,or being traceable from every vertex in terms of the least eigenvalue of the adjacency matrix of the graph.This provides an effective method for us to study some properties for a graph.

        Keywords:least eigenvalue,Hamiltonian path,Hamiltonian cycle,Hamilton-connected graph

        1 Introduction

        LetG=(V,E)be a simple graph of ordernwith vertex set

        and edge setE=E(G).LetKnbe the complete graph of ordern.WriteKn?1+vforKn?1together with an isolated vertex,Kn?1+eforKn?1with a pendent edge,andKn?1+e+e′obtained fromKn?1+vby adding two edges betweenvand two vertices ofKn?1.The join ofGandH,denotedG∨H,is the graph obtained from disjoint union ofGandHby adding edges joining every vertex ofGto every vertex ofH.

        The degree matrix ofGis denoted byD(G)=diag(dG(v1),dG(v2),···,dG(vn)),wheredG(v)denotes the degree of a vertexvin the graphG.The adjacency matrix ofGis defined to be a matrixA(G)=[aij]of ordern,whereaij=1 ifviis adjacent tovj,andaij=0 otherwise.The signless Laplacian matrix ofGis defined by

        Obviously,A(G),Q(G)are real symmetric matrix.So their eigenvalues are real number and can be ordered.The largest eigenvalue ofA(G),denoted byλ(G),is said to be the spectral radius ofG.The least eigenvalue ofA(G),denoted byλmin(G),is said to be the least eigenvalue ofG.The unit eigenvector according toλmin(G)is said to be the first eigenvector ofG.The largest eigenvalue ofQ(G),denoted byq(G),is said to be the signless Laplacian spectral radius ofG.

        LetGbe a simple graph of ordern.A Hamiltonian cycle of the graphGis a cycle of orderncontained inG,and a Hamiltonian path ofGis a path of orderncontained inG.A graph is traceable from every vertex if it contains a Hamilton path from every vertex.A graph is said to be Hamiltonian if it contains Hamiltonian cycles,and is said to be Hamilton-connected if every two vertices ofGare connected by a Hamiltonian path.The problem of deciding whether a graph is Hamiltonian is one of the most difficult classical problems in graph theory.Indeed,determining whether a graph is Hamiltonian is NP-complete.

        Recently,the spectral theory of graphs has been applied to this problem.Reference[1]gives sufficient conditions for a graph to be traceable or Hamiltonian in terms of the spectral radius of the adjacency matrix of the graph or its complements.Reference[2]investigates the spectral radius of the signless Laplacian matrix of the complements of a graph,and present some conditions for the existence of Hamiltonian paths or cycles.The work motivated further research,one may refer to References[3-7].Reference[8]gives some(signless Laplacian)radius spectral conditions for a graph to be Hamiltonconnected.

        However,until now there are few results about characterization the Hamiltonicity of a graph by least eigenvalue.In this paper,we still study the Hamiltonicity of a graph.However,we use the least eigenvalue of the adjacency matrix of the graph,and give some conditions for a graph having Hamiltonian paths or cycles,or being Hamilton-connected,or being traceable from every vertex.

        2 Main results

        99久久久精品免费观看国产| av网页免费在线观看| 欧美性猛交xxx嘿人猛交| 国产成人亚洲综合色婷婷| 在线播放a欧美专区一区| 美女精品国产一区二区三区| 久久亚洲乱码中文字幕熟女| 亚洲无线一二三四区手机| 亚洲另类精品无码专区| 久久久久综合一本久道| 狼人精品剧情av在线观看| 99久热在线精品视频观看| 精品性高朝久久久久久久| 99RE6在线观看国产精品| 免费人成网站在线视频| 99精品国产丝袜在线拍国语| 久久福利青草精品免费 | 青青操国产在线| 国产后入内射在线观看| 精品国产亚洲第一区二区三区| 亚洲av无码乱码国产麻豆| 曰批免费视频播放免费直播 | 一本久久a久久精品vr综合| 中文乱码人妻系列一区二区| 亚洲色图在线视频免费观看| 久久一区二区三区久久久| 极品少妇被猛的白浆直喷白浆| 天堂网www在线资源| 国产亚洲一区二区三区夜夜骚| 新视觉亚洲三区二区一区理伦| 日本在线观看一区二区三| 精品国产乱码久久久久久1区2区| 欧美亚州乳在线观看| 久久伊人精品只有这里有 | 国产亚洲精品一区二区无| 人妻夜夜爽天天爽一区| 在线无码国产精品亚洲а∨| 亚洲成在人线天堂网站| 小辣椒福利视频导航| 欧美日韩在线免费看| 国产日韩乱码精品一区二区|