期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到219篇文章
< 1 2 … 11 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
A POLYNOMIAL ALGORITHM FOR FINDING THEMINIMUM FEEDBACK VERTEX SET OF A3-REGULAR SIMPLE GRAPH 认领 引用 被引量：2
1
作者 李德明 刘彦佩 《Acta Mathematica Scientia》 SCIE 1999年第4期375-381,共7页
A subset of the vertex set of a graph is a feedback vertex set of the graph if the resulting graph is a forest after removed the vertex subset from the graph. A polynomial algorithm for finding a minimum feedback vert... A subset of the vertex set of a graph is a feedback vertex set of the graph if the resulting graph is a forest after removed the vertex subset from the graph. A polynomial algorithm for finding a minimum feedback vertex set of a 3-regular simple graph is provided. 展开更多
关键词 maximum genus nonseparating independent number feedback vertex set 3-regular graph adjacency matching
暂未订购 下载PDF
Path Planning for Substation UAV Inspection Based on 3D Point Cloud Mapping 认领 引用
2
作者 Yanping Chen Zhengxin Zhan +3 位作者 Xiaohui Yan Le Zou Yucheng Zhong Hailei Wang 《Computers, Materials & Continua》 SCIE EI 2026年第5期2138-2159,共22页
With the increasing complexity of substation inspection tasks,achieving efficient and safe path planning for Unmanned Aerial Vehicles in densely populated and structurally complex three-dimensional(3D)environments rem... With the increasing complexity of substation inspection tasks,achieving efficient and safe path planning for Unmanned Aerial Vehicles in densely populated and structurally complex three-dimensional(3D)environments remains a critical challenge.To address this problem,this paper proposes an improved path planning algorithm—Random Geometric Graph(RGG)-guided Rapidly-exploring Random Tree(R-RRT)—based on the classical Rapidly-exploring Random Tree(RRT)framework.First,a refined 3D occupancy grid map is constructed from Light Detection and Ranging point cloud data through ground filtering,noise removal,coordinate transformation,and obstacle inflation using spherical structuring elements.During the planning stage,a dynamic goal-biasing strategy is introduced to adaptively adjust the sampling direction,the sampling distribution is optimized using a pre-generated RGG,and collision detection is accelerated via a K-Dimensional Tree structure.After initial trajectory generation,redundant nodes are eliminated via greedy pruning,and a curvature-minimizing gradient-based optimizationmethod is applied to smooth the trajectory.Experimental results conducted in a simulated substation environment demonstrate that,compared with mainstream path planning algorithms,the proposed R-RRT achieves superior performance in terms of path length,planning time,and trajectory smoothness.Comprehensive analysis shows that the proposed method significantly enhances trajectory quality,planning efficiency,and operational safety,validating its applicability and advantages for high-precision 3D path planning in complex substation inspection scenarios. 展开更多
关键词 R-RRT algorithm unmanned aerial vehicles path planning random geometric graph 3D occupancy grid map substation inspection
暂未订购 下载PDF
SCORE SETS IN ORIENTED 3-PARTITE GRAPHS 认领 引用
3
作者 S.Pirzada Merajuddin T.A.Naikoo 《Analysis in Theory and Applications》 2007年第4期363-374,共12页
Abstract. Let D （U, V, W） be an oriented 3-partite graph with ｜ U ｜ = p, ｜V｜ = q and ｜W ｜ = r. For any vertex x in D（U,V,W）, let dx^＋ and dui^- be the outdegree and indegree ofx respectively. Define aui （o... Abstract. Let D （U, V, W） be an oriented 3-partite graph with ｜ U ｜ = p, ｜V｜ = q and ｜W ｜ = r. For any vertex x in D（U,V,W）, let dx^＋ and dui^- be the outdegree and indegree ofx respectively. Define aui （or simply ai） = q ＋ r ＋ dui^＋ - dui^-, bvj （or simply b j） = p ＋ r ＋ d^＋vj - d^-vj and cwk （or simply ck） =p ＋ q ＋ dwk^＋ -dwk^- as the scores of ui in U,vj in V and wk in W respectively. The set A of distinct scores of the vertices of D（U, V, W） is called its score set. In this paper, we prove that if a1 is a non-negative integer, ai（2 ≤ i ≤ n - 1） are even positive integers and an is any positive integer, then for n 〉 3, there exists an oriented 3-partite graph with the score set A ={a1,Σ2i=1 ai,…,Σni=1 ai}, except when A = {0, 2, 3}. Some more results for score sets in oriented 3-partite graphs are obtained. 展开更多
关键词 oriented graph oriented 3-partite graph tournament score set
暂未订购 下载PDF
Maximal Resonance of{(3,4),4}-Fullerene Graphs 认领 引用
4
作者 YANG Rui MA Yan-fei 《Chinese Quarterly Journal of Mathematics》 2024年第1期1-17,共17页
A{(3,4),4}-fullerene graph S is a 4-regular map on the sphere whose faces are of length 3 or 4.It follows from Euler s formula that the number of triangular faces is eight.A set H of disjoint quadrangular faces of S i... A{(3,4),4}-fullerene graph S is a 4-regular map on the sphere whose faces are of length 3 or 4.It follows from Euler s formula that the number of triangular faces is eight.A set H of disjoint quadrangular faces of S is called resonant pattern if S has a perfect matching M such that every quadrangular face in H is M-alternating.Let k be a positive integer,S is k-resonant if any i≤k disjoint quadrangular faces of S form a resonant pattern.Moreover,if graph S is k-resonant for any integer k,then S is called maximally resonant.In this paper,we show that the maximally resonant{(3,4),4}-fullerene graphs are S_6,S_8,S102,S122,S124,S125,S143,S145,S163,S185,S24as shown in Fig.1.As a corollary,it is shown that if a{(3,4),4}-fullerene graph is 4-resonant,then it is also maximally resonant. 展开更多
关键词 {(3 4) 4}-Fullerene graph k-Resonant Maximally resonant
暂未订购 下载PDF
Fusion Prototypical Network for 3D Scene Graph Prediction 认领 引用
5
作者 Jiho Bae Bogyu Choi +1 位作者 Sumin Yeon Suwon Lee 《Computer Modeling in Engineering & Sciences》 SCIE EI 2025年第6期2991-3003,共13页
Scene graph prediction has emerged as a critical task in computer vision,focusing on transforming complex visual scenes into structured representations by identifying objects,their attributes,and the relationships amo... Scene graph prediction has emerged as a critical task in computer vision,focusing on transforming complex visual scenes into structured representations by identifying objects,their attributes,and the relationships among them.Extending this to 3D semantic scene graph(3DSSG)prediction introduces an additional layer of complexity because it requires the processing of point-cloud data to accurately capture the spatial and volumetric characteristics of a scene.A significant challenge in 3DSSG is the long-tailed distribution of object and relationship labels,causing certain classes to be severely underrepresented and suboptimal performance in these rare categories.To address this,we proposed a fusion prototypical network(FPN),which combines the strengths of conventional neural networks for 3DSSG with a Prototypical Network.The former are known for their ability to handle complex scene graph predictions while the latter excels in few-shot learning scenarios.By leveraging this fusion,our approach enhances the overall prediction accuracy and substantially improves the handling of underrepresented labels.Through extensive experiments using the 3DSSG dataset,we demonstrated that the FPN achieves state-of-the-art performance in 3D scene graph prediction as a single model and effectively mitigates the impact of the long-tailed distribution,providing a more balanced and comprehensive understanding of complex 3D environments. 展开更多
关键词 3D scene graph prediction prototypical network 3D scene understanding
暂未订购 下载PDF
The Cordiality on the Union of 3-regular Connected Graph and Cycle 认领 引用 被引量：3
6
作者 XIE Yan-tao CHE Ying-tao LIU Zhi-shan 《Chinese Quarterly Journal of Mathematics》 2010年第2期244-248,共5页
Diab proved the following graphs are Cordial;Pm K1,n if and only if(m,n) =(1,2);Cm K1,n;Pm Kn;Cm Kn for all m and n except m ≡ 2(mod 4).In this paper,we proved the Cordiality on the union of 3-regular connected graph... Diab proved the following graphs are Cordial;Pm K1,n if and only if(m,n) =(1,2);Cm K1,n;Pm Kn;Cm Kn for all m and n except m ≡ 2(mod 4).In this paper,we proved the Cordiality on the union of 3-regular connected graph K3 and cycle Cm.First we have the Lemma 2,if uv ∈ E(G),G is Cordial,we add 4 vertices x,y,z,w in sequence to the edge uv,obtain a new graph denoted by G*,then G* is still Cordial,by this lemma,we consider four cases on the union of 3-regular connected graph R3,and for every case we distinguish four subcases on the cycle Cm. 展开更多
关键词 3-regular graph Cordial graph union graph
暂未订购 下载PDF
On 3-Hued Coloring of Graphs 认领 引用
7
作者 Ting LIU Lei SUN 《Journal of Mathematical Research with Applications》 CSCD 2014年第1期43-48,共6页
For integers k 0, r 0, a（k, r）-coloring of a graph G is a proper k-coloring of the vertices such that every vertex of degree d is adjacent to vertices with at least min{d, r} diferent colors. The r-hued chromatic nu... For integers k 0, r 0, a（k, r）-coloring of a graph G is a proper k-coloring of the vertices such that every vertex of degree d is adjacent to vertices with at least min{d, r} diferent colors. The r-hued chromatic number, denoted by χr（G）, is the smallest integer k for which a graph G has a（k, r）-coloring. Define a graph G is r-normal, if χr（G） = χ（G）. In this paper, we present two sufcient conditions for a graph to be 3-normal, and the best upper bound of 3-hued chromatic number of a certain families of graphs. 展开更多
关键词 r-hued chromatic number 3-normal graph triangle.
暂未订购 下载PDF
The L(3,2,1)-labeling on Bipartite Graphs 认领 引用
8
作者 YUAN WAN-LIAN ZHAI MING-QING Lǔ CHANG-HONG 《Communications in Mathematical Research》 2009年第1期79-87,共9页
An L（3, 2, 1）-labeling of a graph G is a function from the vertex set V（G） to the set of all nonnegative integers such that ｜f（u）-f（v）｜≥3 if dG（u,v） = 1, ｜f（u）-f（v）｜≥2 if dG（u,v） = 2, and ｜f（u... An L（3, 2, 1）-labeling of a graph G is a function from the vertex set V（G） to the set of all nonnegative integers such that ｜f（u）-f（v）｜≥3 if dG（u,v） = 1, ｜f（u）-f（v）｜≥2 if dG（u,v） = 2, and ｜f（u）-f（v）｜≥1 if dG（u,v） = 3. The L（3, 2,1）-labeling problem is to find the smallest number λ3（G） such that there exists an L（3, 2,1）-labeling function with no label greater than it. This paper studies the problem for bipartite graphs. We obtain some bounds of λ3 for bipartite graphs and its subclasses. Moreover, we provide a best possible condition for a tree T such that λ3（T） attains the minimum value. 展开更多
关键词 channel assignment problems L（2,1）-labeling L（3 2,1）-labeling bi-partite graph tree
暂未订购 下载PDF
A Note on the Girth of 3-Regular Hamiltonian Graph 认领 引用
9
作者 ZHAO Qiu-lan YUAN Jin-jiang 《Chinese Quarterly Journal of Mathematics》 2022年第4期430-431,共2页
It is well-known that the Petersen graph is nonhamiltonian.A very short proof for this result was presented in[2]due to D.B.West.In this note,by extending the proof technique in[2],we briefly show that the girth of ev... It is well-known that the Petersen graph is nonhamiltonian.A very short proof for this result was presented in[2]due to D.B.West.In this note,by extending the proof technique in[2],we briefly show that the girth of every 3-regular hamiltonian graph on n≥10 vertices is at most(n+4)/3. 展开更多
关键词 Girth Hamiltonian graph 3-Regular graph
暂未订购 下载PDF
Cover a 3-regular Claw-free Graph by Induced Matchings 认领 引用
10
作者 DONG Li TANG Jing-yong SONG Xin-yu 《Chinese Quarterly Journal of Mathematics》 CSCD 2011年第3期355-359,共5页
The induced matching cover number of a graph G without isolated vertices, denoted by imc(G),is the minimum integer k such that G has k induced matchings {M1,M2,···,Mk}such that,V(M1)∪V(M2)∪··... The induced matching cover number of a graph G without isolated vertices, denoted by imc(G),is the minimum integer k such that G has k induced matchings {M1,M2,···,Mk}such that,V(M1)∪V(M2)∪···∪V(Mk)covers V(G).This paper shows that,if G is a 3-regular claw-free graph,then imc(G)∈{2,3}. 展开更多
关键词 induced matching induced matching cover 3-regular claw-free
暂未订购 下载PDF
The 3-decomposition conjecture of cubic graphs 认领 引用
11
作者 Genghua Fan Shanshan Guo Chuixiang Zhou 《Science China Mathematics》 SCIE CSCD 2026年第8期2239-2248,共10页
The 3-decomposition conjecture states that every connected cubic graph can be decomposed into a spanning tree,a union of cycles,and a matching.In this paper,we use a rooted spanning tree as a tool to show that every c... The 3-decomposition conjecture states that every connected cubic graph can be decomposed into a spanning tree,a union of cycles,and a matching.In this paper,we use a rooted spanning tree as a tool to show that every connected cubic graph of size n can be decomposed into a spanning tree,a union of cycles,a matching,and a union of at most (n-4)/8 paths of length 2. 展开更多
关键词 graph decomposition cubic graph 3-decomposition conjecture rooted spanning tree
暂未订购 下载PDF
Global Dynamic Modeling of Electro-Hydraulic 3-UPS/S Parallel Stabilized Platform by Bond Graph 认领 引用 被引量：13
12
作者 ZHANG Lijie GUO Fei +1 位作者 LI Yongquan LU Wenjuan 《Chinese Journal of Mechanical Engineering》 SCIE EI CAS CSCD 2016年第6期1176-1185,共10页
Dynamic modeling of a parallel manipulator（PM） is an important issue. A complete PM system is actually composed of multiple physical domains. As PMs are widely used in various fields, the importance of modeling the ... Dynamic modeling of a parallel manipulator（PM） is an important issue. A complete PM system is actually composed of multiple physical domains. As PMs are widely used in various fields, the importance of modeling the global dynamic model of the PM system becomes increasingly prominent. Currently there lacks further research in global dynamic modeling. A unified modeling approach for the multi-energy domains PM system is proposed based on bond graph and a global dynamic model of the 3-UPS/S parallel stabilized platform involving mechanical and electrical-hydraulic elements is built. Firstly, the screw bond graph theory is improved based on the screw theory, the modular joint model is modeled and the normalized dynamic model of the mechanism is established. Secondly, combined with the electro-hydraulic servo system model built by traditional bond graph, the global dynamic model of the system is obtained, and then the motion, force and power of any element can be obtained directly. Lastly, the experiments and simulations of the driving forces, pressure and flow are performed, and the results show that, the theoretical calculation results of the driving forces are in accord with the experimental ones, and the pressure and flow of the first limb and the third limb are symmetry with each other. The results are reasonable and verify the correctness and effectiveness of the model and the method. The proposed dynamic modeling method provides a reference for modeling of other multi-energy domains system which contains complex PM. 展开更多
关键词 screw bond graph multi-energy domains 3-UPS/S parallel mechanism electro-hydraulic servo system
暂未订购 下载PDF
SGT-Net: A Transformer-Based Stratified Graph Convolutional Network for 3D Point Cloud Semantic Segmentation 认领 引用 被引量：2
13
作者 Suyi Liu Jianning Chi +2 位作者 Chengdong Wu Fang Xu Xiaosheng Yu 《Computers, Materials & Continua》 SCIE EI 2024年第6期4471-4489,共19页
In recent years,semantic segmentation on 3D point cloud data has attracted much attention.Unlike 2D images where pixels distribute regularly in the image domain,3D point clouds in non-Euclidean space are irregular and... In recent years,semantic segmentation on 3D point cloud data has attracted much attention.Unlike 2D images where pixels distribute regularly in the image domain,3D point clouds in non-Euclidean space are irregular and inherently sparse.Therefore,it is very difficult to extract long-range contexts and effectively aggregate local features for semantic segmentation in 3D point cloud space.Most current methods either focus on local feature aggregation or long-range context dependency,but fail to directly establish a global-local feature extractor to complete the point cloud semantic segmentation tasks.In this paper,we propose a Transformer-based stratified graph convolutional network(SGT-Net),which enlarges the effective receptive field and builds direct long-range dependency.Specifically,we first propose a novel dense-sparse sampling strategy that provides dense local vertices and sparse long-distance vertices for subsequent graph convolutional network(GCN).Secondly,we propose a multi-key self-attention mechanism based on the Transformer to further weight augmentation for crucial neighboring relationships and enlarge the effective receptive field.In addition,to further improve the efficiency of the network,we propose a similarity measurement module to determine whether the neighborhood near the center point is effective.We demonstrate the validity and superiority of our method on the S3DIS and ShapeNet datasets.Through ablation experiments and segmentation visualization,we verify that the SGT model can improve the performance of the point cloud semantic segmentation. 展开更多
关键词 3D point cloud semantic segmentation long-range contexts global-local feature graph convolutional network dense-sparse sampling strategy
暂未订购 下载PDF
Bounds on the Aα-Spectral Radius of a C3-Free Graph 认领 引用 被引量：1
14
作者 Dongxia ZHU Shuguang GUO Rong ZHANG 《Journal of Mathematical Research with Applications》 CSCD 2022年第1期1-7,共7页
Let G be a simple undirected graph.For any real numberα∈[0,1],Nikiforov defined the Aα-matrix of G as Aα(G)=αD(G)+(1-α)A(G)in 2017,where A(G)and D(G)are the adjacency matrix and the degree diagonal matrix ... Let G be a simple undirected graph.For any real numberα∈[0,1],Nikiforov defined the Aα-matrix of G as Aα(G)=αD(G)+(1-α)A(G)in 2017,where A(G)and D(G)are the adjacency matrix and the degree diagonal matrix of G,respectively.In this paper,we obtain a lower bound on the Aα-spectral radius of a C3-free graph forα∈[0,1)and a sharp upper bound on the Aα-spectral radius of a C3-free k-cycle graph forα∈[1/2,1). 展开更多
关键词 C3-free graph k-cycle graph Aα-spectral radius bound
暂未订购 下载PDF
GCR-Net:3D Graph convolution-based residual network for robust reconstruction in cerenkov luminescence tomography 认领 引用
15
作者 Weitong Li Mengfei Du +7 位作者 Yi Chen Haolin Wang Linzhi Su Huangjian Yi Fengjun Zhao Kang Li Lin Wang Xin Cao 《Journal of Innovative Optical Health Sciences》 SCIE EI CSCD 2023年第1期15-25,共11页
Cerenkov Luminescence Tomography(CLT)is a novel and potential imaging modality which can display the three-dimensional distribution of radioactive probes.However,due to severe ill-posed inverse problem,obtaining accur... Cerenkov Luminescence Tomography(CLT)is a novel and potential imaging modality which can display the three-dimensional distribution of radioactive probes.However,due to severe ill-posed inverse problem,obtaining accurate reconstruction results is still a challenge for traditional model-based methods.The recently emerged deep learning-based methods can directly learn the mapping relation between the surface photon intensity and the distribution of the radioactive source,which effectively improves the performance of CLT reconstruction.However,the previously proposed deep learning-based methods cannot work well when the order of input is disarranged.In this paper,a novel 3D graph convolution-based residual network,GCR-Net,is proposed,which can obtain a robust and accurate reconstruction result from the photon intensity of the surface.Additionally,it is proved that the network is insensitive to the order of input.The performance of this method was evaluated with numerical simulations and in vivo experiments.The results demonstrated that compared with the existing methods,the proposed method can achieve efficient and accurate reconstruction in localization and shape recovery by utilizing threedimensional information. 展开更多
关键词 Cerenkov luminescence tomography optical molecular imaging optical tomography deep learning 3D graph convolution
暂未订购 下载PDF
Three-Rainbow Coloring of Split Graphs 认领 引用
16
作者 胡玉梅 刘婷婷 《Transactions of Tianjin University》 EI CAS 2015年第3期284-287,共4页
After a necessary condition is given, 3-rainbow coloring of split graphs with time complexity O(m) is obtained by constructive method. The number of corresponding colors is at most 2 or 3 more than the minimum number ... After a necessary condition is given, 3-rainbow coloring of split graphs with time complexity O(m) is obtained by constructive method. The number of corresponding colors is at most 2 or 3 more than the minimum number of colors needed in a 3-rainbow coloring. 展开更多
关键词 edge coloring 3-rainbow coloring algorithm split graph
暂未订购 下载PDF
GRAPH GRAMMAR METHOD FOR 3-D CORNER DETECTION 认领 引用
17
作者 关卓威 张晔 《Transactions of Nanjing University of Aeronautics and Astronautics》 EI 2012年第3期289-293,共5页
Most of local feature descriptors assume that the scene is planar. In the real scene, the captured images come from the 3-D world. 3-D corner as a novel invariant feature is important for the image matching and the ob... Most of local feature descriptors assume that the scene is planar. In the real scene, the captured images come from the 3-D world. 3-D corner as a novel invariant feature is important for the image matching and the object detection, while automatically discriminating 3-D corners from ordinary corners is difficult. A novel method for 3-D corner detection is proposed based on the image graph grammar, and it can detect the 3-D features of corners to some extent. Experimental results show that the method is valid and the 3-D corner is useful for image matching. 展开更多
关键词 graph grammar 3-D corner detection production rule
暂未订购 下载PDF
Integrating Attention Mechanisms in Graph Neural Networks for Marine Oil Spill Detection 认领 引用
18
作者 CAI Fengjing WANG Yue +5 位作者 TIAN Zhuangcai LI Xi’an XU Jing MO Yuming ZHANG Shaotong WU Jinran 《Journal of Ocean University of China》 SCIE CAS CSCD 2025年第5期1327-1340,I0003-I0014,共14页
The increasing frequency of offshore engineering activities,particularly the expansion of offshore oil transport and the rise in the number of oil platforms,has greatly increased the potential risk of marine oil spill... The increasing frequency of offshore engineering activities,particularly the expansion of offshore oil transport and the rise in the number of oil platforms,has greatly increased the potential risk of marine oil spill incidents.Historically,several large oil spills have had long-term adverse effects on marine ecosystems and economic development,highlighting the importance of accurate-ly delineating and monitoring oil spill areas.In this study,graph neural network technology is introduced to implement semantic seg-mentation of SAR images,and two graph neural network models based on Graph-FCN and Graph-DeepLabV3+with the introduction of an attention mechanism are constructed and evaluated to improve the accuracy and efficiency of oil spill detection.By com-paring the Swin-Unet model,the Graph-DeepLabV3+model performs better in complex scenarios,especially in edge detail recognition.This not only provides strong technical support for marine oil spill monitoring but also provides an effective solution to deal with the potential risks brought by the increase of marine engineering activities,which is of great practical significance as it helps to safeguard the health and sustainable development of marine ecosystems and reduce the economic losses. 展开更多
关键词 marine oil spill monitoring graph neural network semantic segmentation Swin-Unet Graph-DeeplabV3+
暂未订购 下载PDF
3D scene graph prediction from point clouds 认领 引用 被引量：1
19
作者 Fanfan WU Feihu YAN +1 位作者 Weimin SHI Zhong ZHOU 《虚拟现实与智能硬件（中英文）》 EI 2022年第1期76-88,共13页
Background In this study,we propose a novel 3D scene graph prediction approach for scene understanding from point clouds.Methods It can automatically organize the entities of a scene in a graph,where objects are nodes... Background In this study,we propose a novel 3D scene graph prediction approach for scene understanding from point clouds.Methods It can automatically organize the entities of a scene in a graph,where objects are nodes and their relationships are modeled as edges.More specifically,we employ the DGCNN to capture the features of objects and their relationships in the scene.A Graph Attention Network(GAT)is introduced to exploit latent features obtained from the initial estimation to further refine the object arrangement in the graph structure.A one loss function modified from cross entropy with a variable weight is proposed to solve the multi-category problem in the prediction of object and predicate.Results Experiments reveal that the proposed approach performs favorably against the state-of-the-art methods in terms of predicate classification and relationship prediction and achieves comparable performance on object classification prediction.Conclusions The 3D scene graph prediction approach can form an abstract description of the scene space from point clouds. 展开更多
关键词 Scene understanding 3D scene graph Point cloud DGCNN GAT
暂未订购 下载PDF
Spanning Trees with Few Leaves in Almost Claw-Free Graphs 认领 引用
20
作者 Xiaodong CHEN Mingchu LI Meijin XU 《Journal of Mathematical Research with Applications》 CSCD 2016年第4期450-456,共7页
A spanning tree with no more than 3 leaves is called a spanning 3-ended tree. In this paper, we prove that if G is a k-connected （k≥ 2） almost claw-free graph of order n and σk＋3（G） ≥ n ＋ k ＋ 2, then G conta... A spanning tree with no more than 3 leaves is called a spanning 3-ended tree. In this paper, we prove that if G is a k-connected （k≥ 2） almost claw-free graph of order n and σk＋3（G） ≥ n ＋ k ＋ 2, then G contains a spanning 3-ended tree, where σk（G） = min{∑es deg（v） ： S is an independent set of G with ｜S｜ = k}. 展开更多
关键词 spanning 3-ended tree almost claw-free graph insertible vertex non-insertible vertex
暂未订购 下载PDF
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 2 … 11 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈