您要查找的是不是：
- Their algorithm certainly can be used to solve the problem on unicyclic graphs. 他们的演算法当然可以拿来解决单环图的点搜寻问题。
- Relationship between the perfect dominating number of the unicyclic graphs and their order is given. 此外，给出了单圈图的完美控制数与其阶数的关系。
- Besides, we study the node-searching problem on unicyclic graphs, which have treewidth 2. 除此之外，我们也研究单环图的点搜寻问题，其中单环图的树宽度为2。
- Recently, Tan Xuezhong and Liu Bolian in [2] obtained a sufficient condition for the unicyclic graphs with nullity 0 and asked a problem that if this condition is also necessary. 在文献[2]中作者给出了刻画非奇异单圈图的充分条件，并提出了一个问题，即这个条件是否也是必要的。
- In this dissertation, using the concept of oriented search strategy, we propose a linear-time and more simplified algorithm for the node-searching problem on unicyclic graphs. 在本论文中，运用导向搜寻策略的概念，我们对于单环图的点搜寻问题提出一个不但是线性时间并且相对简洁的演算法。
- We conclude the thesis with Chapter 5 by proposing some problems for further research on the extremal values of the first general Zagreb index, of the reformulated Zagreb index, and the extremal values of the unicyclic graphs of the general Randic index. 在论文的第五章里,我们对第一广义Zagerb指标的极值,改进的原始Zagreb指标的极值,以及单圈图的广义Randi(?) 指标的极值提出了一些可以进一步研究的问题。
- The Laplacian Spectrum of Unicyclic Graphs 单圈图的Laplacian谱(英文)
- Keywords Randi（?） index;matching;tree;unicyclic graph;lower bound;diameter;fault-tolerant routing;surviving route graph;Cartesian product; 指数;匹配;树;单圈图;下界;直径;容错路由选择;幸存路径图;笛卡尔乘积;
- An electrically produced graph or tracing. 电示图以电制作的图表或映描图
- The graph shows a bulge in the price of meat. 图表显示肉类价格上涨。
- unicyclic graph 单圈图
- A line representing data on a graph. 曲线在图表上代表数据的一条线
- The graph flattens out gradually after a steep fall. 图表上的曲线突降之後逐渐趋於平稳。
- The box that appears below a graph, identifying the fields of the graph. 出现在图下部的说明，用以标识图的各区域。
- Our soundings are displayed in the form of a graph. 我们的调查结果已用图表列出.
- Efficient Dominating Set and Perfect Dominating Set of Circulant Graphs and Unicyclic Graphs 循环图及单圈图的有效控制集与完美控制集
- The graph traced by an oscillograph. 示波图用示波器画出的图
- An Upper Bound on the Second Largest EigenValue of Unicyclic Graphs with Perfect Matchings 具有完美匹配的单圈图第二大特征值的上界
- The Largest Eigenvalues of Laplacian Matrices of Trees and Unicyclic Graphs Given the Order an Edge Independence Number 给定阶与边独立数的树和单圈图的Laplacian矩阵的最大特征值
- The graph K1 is hence nonplanar. 于是，图K1是非平面的。
