排序方式: 共有61条查询结果,搜索用时 46 毫秒
51.
Eunjeong Yi 《数学学报(英文版)》2013,29(8):1479-1492
A vertex x in a graph G strongly resolves a pair of vertices v, w if there exists a shortest x-w path containing v or a shortest x-v path containing w in G. A set of vertices S■V(G) is a strong resolving set of G if every pair of distinct vertices of G is strongly resolved by some vertex in S. The strong metric dimension of G, denoted by sdim(G), is the minimum cardinality over all strong resolving sets of G. For a connected graph G of order n≥2, we characterize G such that sdim(G) equals 1, n-1, or n-2, respectively. We give a Nordhaus-Gaddum-type result for the strong metric dimension of a graph and its complement: for a graph G and its complement G, each of order n≥4 and connected, we show that 2≤sdim(G)+sdim(G)≤2( n-2). It is readily seen that sdim(G)+sdim(G)=2 if and only if n=4; we show that, when G is a tree or a unicyclic graph, sdim(G)+sdim(G)=2(n 2) if and only if n=5 and G ~=G ~=C5, the cycle on five vertices. For connected graphs G and G of order n≥5, we show that 3≤sdim(G)+sdim(G)≤2(n-3) if G is a tree; we also show that 4≤sdim(G)+sdim(G)≤2(n-3) if G is a unicyclic graph of order n≥6. Furthermore, we characterize graphs G satisfying sdim(G)+sdim(G)=2(n-3) when G is a tree or a unicyclic graph. 相似文献
52.
设U*为一个未定向的n个顶点上的单圈混合图,它是由一个三角形在其某个顶点上附加n-3个悬挂边而获得.在文[Largest eigenvalue of a unicyclic mixed graph,Applied Mathematics A Journal of Chinese Universities(Ser.B),2004,19(2):140-148]中,作者证明了:在相差符号同构意下,在所有n个顶点上的单圈混合图中,U*是唯一的达到最大Laplace谱半径的混合图.本文应用非负矩阵的Perron向量,给出上述结论的一个简单的证明. 相似文献
53.
54.
得到了具有完美匹配的单圈图第二大特征值的一个上界.同时也给出了具有完美匹配的单圈图的第二大特征值的最大值的一个下界. 相似文献
55.
A graph G with p vertices and q edges, vertex set V(G) and edge set E(G), is said to be super vertex-graceful (in short SVG), if there exists a function pair (f, f
+) where f is a bijection from V(G) onto P, f
+ is a bijection from E(G) onto Q, f
+((u, v)) = f(u) + f(v) for any (u, v) ∈ E(G),
and
We determine here families of unicyclic graphs that are super vertex-graceful.
相似文献
56.
本文给出了$2$为完美匹配单圈图的无符号拉普拉斯特征值的充分必要条件. 相似文献
57.
A comparison between the metric dimension and zero forcing number of trees and unicyclic graphs 下载免费PDF全文
The metric dimension dim(G)of a graph G is the minimum number of vertices such that every vertex of G is uniquely determined by its vector of distances to the chosen vertices.The zero forcing number Z(G)of a graph G is the minimum cardinality of a set S of black vertices(whereas vertices in V(G)\S are colored white)such that V(G)is turned black after finitely many applications of"the color-change rule":a white vertex is converted black if it is the only white neighbor of a black vertex.We show that dim(T)≤Z(T)for a tree T,and that dim(G)≤Z(G)+1 if G is a unicyclic graph;along the way,we characterize trees T attaining dim(T)=Z(T).For a general graph G,we introduce the"cycle rank conjecture".We conclude with a proof of dim(T)-2≤dim(T+e)≤dim(T)+1 for e∈E(T). 相似文献
58.
由Graovac和Ghorbani定义的另一种新的原子键连通性指标, 我们称之为第二原子键连通性指标(简记为$ABC_{2}$). 它为研究分子特征提供了方便, 且其极值问题是研究的重点. 本文通过分式比较, 给出了$n$个顶点的具有最小$ABC_2$指标的单圈图及其结构性质. 相似文献
59.
The energy of a graph is defined as the sum of the absolute values of all the eigenvalues of the graph. For a given positive
integer d with , we characterize the graphs with minimal energy in the class of unicyclic graphs with n vertices and a given diameter d.
相似文献
60.
设图\,$H(p,tK_{1,m})$\,是一个顶点数为\,$p+mt$\,的连通单圈图,它是由圈\,$C_{p}$\,的依次相邻的\,$t(1\leq t\leq p)$\,个顶点、每一个顶点分别与星\,$K_{1,m}$\,的中心重合而得到的单圈图. 证明了单圈图\,$ H( p,p K_{1,4})$, $H(p,p K_{1,3})$, $H(p,(p-1)K_{1,3})$\,是由它们的\,Laplacian\,谱确定的,并证明了当\,$p$\,为偶数时,单圈图\,$H(p,$2K_{1,3})$, $H( p,(p-2) K_{1,3})$, $H(p,(p-3)K_{1,3})$\,也是由它们的\,Laplacian\,谱确定的. 相似文献