检索结果-南通市图书馆

On the Distance Signless Laplacian spectral radius of Bicyclic Graphs

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Mathematical Research with Applications 2023年第3期43卷 289-302页

作者： Nannan XU Aimei YU School of Mathematics and Stastics Beijing Jiaotong University

The distance signless Laplacian matrix of a connected graph G is defined as Q(G)=Tr(G)+D(G), where Tr(G) is the diagonal matrix of the vertex transmissions in G and D(G) is the distance matrix of G. The largest eigenvalue of the distance signless Laplacian matrix is called the distance signless Laplacian spectral radius of G. In this paper, we determine the unique graph with the maximum distance signless Laplacian spectral radius among all the bicyclic graphs with given order.

关键词： distance signless Laplacian matrix spectral radius bicyclic graph

Estimations for the spectral radius of Nonnegative Tensors

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Mathematical Research with Applications 2020年第5期40卷 487-492页

作者： Aiquan JIAO School of Mathematical and Physical Science and Engineering Hebei University of Engineering

In this paper, a lower bound and an upper bound for the spectral radius of nonnegative tensors are obtained. Our new bounds are tighter than the corresponding bounds obtained by Li et al.(J. Inequal. Appl. 2015). A nu... 详细信息

关键词： bounds spectral radius nonnegative tensor irreducible

A Lower Bound for the Distance Signless Laplacian spectral radius of Graphs in Terms of Chromatic Number

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Mathematical Research with Applications 2014年第3期34卷 289-294页

作者： Xiaoxin LI Yizheng FAN Shuping ZHA Department of Mathematics and Computer Sciences Chizhou University School of Mathematical Sciences Anhui University School of Mathematics and Computation Sciences Anqing Normal University

Let G be a connected graph on n vertices with chromatic number k, and let ρ(G)be the distance signless Laplacian spectral radius of G. We show that ρ(G) ≥ 2n + 2「n k」- 4,with equality if and only if G is a regula... 详细信息

关键词： distance matrix distance signless Laplacian spectral radius chromatic number.

Hypergraphs with spectral radius between Two Limit Points

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Mathematical Research with Applications 2018年第1期38卷 1-22页

作者： Shoudong MAN Linyuan LU Shuhua ZHANG Department of Mathematics Tianjin University of Finance and Economics Department of Mathematics University of South Carolina

In this paper, we set ρ;=;4;and ρ′;= β;, where β =-1/6 ·(100 + 12·（69）;);-2/(3·(100+12·（69）;));+4/3≈0.2451223338. We consider connected r-uniform hypergraphs with spectral radius between ρ;and ρ′;and ... 详细信息

关键词： r-uniform hypergraphs spectral radius α-normal

spectral radius of the Canonical Particle Swarm Optimization

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Spectral Radius of the Canonical Particle Swarm Optimization

A Note on the spectral radius of Weighted Signless Laplacian Matrix

第三十届中国控制会议

作者： LIU Jun,REN Xuemei,MA Hongbin School of Automation,Beijing Institution of Technology,Beijing 100081,P.R.China

＜正＞Existing stability analysis of particle swarm optimization（PSO） algorithm,a class of widely used stochastic global optimization methods,is merely based on the constant transfer matrix,which is in fact the expectation of step-varying transfer matrices involving random variables,however,theoretically speaking,the stability of standard PSO algorithm involves one challenging yet long-term ignored problem of calculating spectral radius of the product of asymmetric transfer matrices at each step,whose mean and variance is carefully investigated in this contribution with the Monte Carlo *** extensive experimental studies conducted provides the guideline for parameter selection and the tradeoff between exploration ability and exploitation ability,and analyzes the relationship between the mean spectral radius and inertia weight as well as acceleration coefficients in PSO *** results indicate that the existing stability analysis is essentially meaningless in sense that most sample trajectories of the system do not coincide with those analyzed in previous studies which simply utilize the constant transfer matrix.

关键词： Particle swarm optimization Convergence analysis spectral radius Time-varying linear system

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Advances in Linear Algebra & Matrix Theory 2018年第1期8卷 53-63页

作者： Serife Büyükkose Nursah Mutlu Gülistan Kaya Gok Departments of Mathematics Faculty of SciencesGazi UniversityAnkaraTurkey Department of Mathematics Education Hakkari UniversityHakkariTurkey

A weighted graph is a graph that has a numeric label associated with each edge, called the weight of edge. In many applications, the edge weights are usually represented by nonnegative integers or square matrices. The weighted signless Laplacian matrix of a weighted graph is defined as the sum of adjacency matrix and degree matrix of same weighted graph. In this paper, a brief overview of the notation and concepts of weighted graphs that will be used throughout this study is given. In Section 2, the weighted signless Laplacian matrix of simple connected weighted graphs is considered, some upper bounds for the spectral radius of the weighted signless Laplacian matrix are obtained and some results on weighted and unweighted graphs are found.

关键词： Weighted Graph Weighted Signless Laplacian Matrix spectral radius

On the Maximum spectral radius of (m,n)-trees with Given Diameter

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Chinese Quarterly Journal of Mathematics 2006年第1期21卷 129-137页

作者： CHENG Wei TAN Shang-wang College of Science Tianjin University of Commerce Tianjin 300134 China Department of Mathematics University of Petroleum Dongying 257061 China

Let （V, U） be the vertex-partition of tree T as a bipartite graph. T is called an （m, n）-tree if ｜V｜ = m and ｜U｜ = n. For given positive integers m, n and d, the maximum spectral radius of all （m, n）-trees o... 详细信息

关键词： spectral radius diameter star path tree

维普期刊数据库

On the Sharp Upper Bound of spectral radius of Weighted Trees

在线全文

学校读者我要写书评

暂无评论

Journal of Mathematical Research and Exposition 2009年第2期29卷 293-301页

作者： TAN Shang Wang Department of Applied Mathematics China University of Petroleum Shandong 257061 China

The spectrum of weighted graphs are often used to solve the problems in the design of networks and electronic circuits. In this paper, we derive the sharp upper bound of spectral radius of all weighted trees on given ... 详细信息

关键词： weighted tree spectral radius matching.

维普期刊数据库

On the spectral radius of Trees with the Given Diameter d

在线全文

学校读者我要写书评

暂无评论

Chinese Quarterly Journal of Mathematics 2004年第1期19卷 57-62页

作者： TANShang-wang GUOJi-ming QIJian DepartmentofAppliedMathematics PetroleumUniversityDongying257061China

Let T denote a tree with the diameter d(d≥2) and order n. Let Pd,r,n-d-1 denote the tree obtained by identifying the rth vertex of path Pd+1 and the center of star K1,n-d-1, where r = r(d) is the integer part about d... 详细信息

关键词： tree spectral radius diameter star path

维普期刊数据库