期刊文献+

二次检索

题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到274篇文章
< 1 2 14 >
每页显示 20 50 100
SGT-Net: A Transformer-Based Stratified Graph Convolutional Network for 3D Point Cloud Semantic Segmentation
1
作者 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
Maximal Resonance of{(3,4),4}-Fullerene Graphs
2
作者 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,S_(10)^(2),S_(12)^(2),S_(12)^(4),S_(12)^(5),S_(14)^(3),S_(14)^(5),S_(16)^(3),S_(18)^(5),S_(24)as 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
GCR-Net:3D Graph convolution-based residual network for robust reconstruction in cerenkov luminescence tomography
3
作者 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 CAS 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
Two New Complexes with the Same(3,8)-Connected tfz-d Topology Based on [Co4(μ3-OH)2] Clusters and Different Aromatic Multicarboxylic Acids 被引量:1
4
作者 屠长征 缪娇娇 +3 位作者 侯能邦 陈广 李俊莉 杨玉亭 《Chinese Journal of Structural Chemistry》 SCIE CAS CSCD 2016年第6期903-913,共11页
Two new metal-organic frameworks(MOFs), namely, [Co_2(L_1)(bix)(μ_3-OH)]·2H_2O(1) and [Co_2(L_2)(bix)(μ_3-OH)]·2.5H_2O(2)(H_3L_1 = 5-oxyacetate isophthalic acid, H_3L_2 = 3,5-bis-oxyacet... Two new metal-organic frameworks(MOFs), namely, [Co_2(L_1)(bix)(μ_3-OH)]·2H_2O(1) and [Co_2(L_2)(bix)(μ_3-OH)]·2.5H_2O(2)(H_3L_1 = 5-oxyacetate isophthalic acid, H_3L_2 = 3,5-bis-oxyacetate-benzoic acid, bix = 1,4-bis(imidazol-1-ylmethyl)benzene), have been synthesized under hydrothermal conditions. Their structures were determined by single-crystal X-ray diffraction analysis and further characterized by elemental analysis, IR spectra, and powder X-ray diffraction(PXRD) analysis. Both complexes 1 and 2 demonstrate identical three-dimensional(3D)(3,8)-connected tfz-d nets with(4~3)_2(4~6·6^(18)·8~4) topologies, where the tetranuclear [Co_4(μ_3-OH)_2] clusters act as 8-connected nodes and aromatic multicarboxylic ligands as 3-connected nodes. The results show that the ligands with different geometrical conformations can form products with the same topological structures. Their thermal and magnetic properties were also investigated. 展开更多
关键词 Co(Ⅱ) cluster 3 8)-connected net crystal structure magnetic property
下载PDF
不超过7阶的3-关系图的刻画
5
作者 黄茹雅 龙旸靖 詹鹏锦 《华中师范大学学报(自然科学版)》 CAS CSCD 北大核心 2024年第2期159-164,共6页
给定一个图G,如果存在一个边标号树T,使得树T的叶子集等于图G的顶点集,并且树T任何叶子x到叶子y的唯一路径上的边标号之和为3当且仅当xy为图G的边,那么称图G是一个3-关系图.该文讨论了什么样的图是3-关系图,证明了图G是3-关系图的必要... 给定一个图G,如果存在一个边标号树T,使得树T的叶子集等于图G的顶点集,并且树T任何叶子x到叶子y的唯一路径上的边标号之和为3当且仅当xy为图G的边,那么称图G是一个3-关系图.该文讨论了什么样的图是3-关系图,证明了图G是3-关系图的必要条件为图G是二部图,即只要图G包含奇圈,则图G不是3-关系图.更进一步,完全刻画了圈为3-关系图的充要条件,即一个圈是3-关系图当且仅当圈为偶圈,并且给出了偶圈相对应的边标号树.最后讨论了比较小的图为3-关系图的条件,即证明了阶至多为7的图是3-关系图的充分必要条件为图G是二部图. 展开更多
关键词 3-关系图 边标号树 二部图
下载PDF
On Graphs with Equal Connected Domination and 2-connected Domination Numbers
6
作者 CHEN Hong-yu ZHU Zhe-li 《Chinese Quarterly Journal of Mathematics》 CSCD 2010年第1期98-103,共6页
A subset S of V is called a k-connected dominating set if S is a dominating set and the induced subgraph S has at most k components.The k-connected domination number γck(G) of G is the minimum cardinality taken ove... A subset S of V is called a k-connected dominating set if S is a dominating set and the induced subgraph S has at most k components.The k-connected domination number γck(G) of G is the minimum cardinality taken over all minimal k-connected dominating sets of G.In this paper,we characterize trees and unicyclic graphs with equal connected domination and 2-connected domination numbers. 展开更多
关键词 connected domination number 2-connected domination number trees unicyclic graphs
下载PDF
基于边权的最小权重3路顶点覆盖算法
7
作者 范鼎 刘春颜 +1 位作者 李洋 赵蕴龙 《应用科技》 CAS 2024年第4期69-74,共6页
城际仓储选址通常可以转化为顶点覆盖问题,顶点覆盖问题是一种经典的NP难问题。针对最小权重3路顶点覆盖问题,设计了基于边权和顶点度的贪心策略,构建了1个两阶段的最小权重3路顶点覆盖算法。通过与2种较优的最小权重3路顶点覆盖算法进... 城际仓储选址通常可以转化为顶点覆盖问题,顶点覆盖问题是一种经典的NP难问题。针对最小权重3路顶点覆盖问题,设计了基于边权和顶点度的贪心策略,构建了1个两阶段的最小权重3路顶点覆盖算法。通过与2种较优的最小权重3路顶点覆盖算法进行对比实验分析可知,本文提出的算法在城际物流仓储选址问题中具有较好的效果,最小权重和分别减少了3.34和1.13个百分点。 展开更多
关键词 顶点覆盖 3路顶点覆盖 最小权重3路顶点覆盖 组合优化 图论 边权策略 物流建仓 贪心策略
下载PDF
GRAPH GRAMMAR METHOD FOR 3-D CORNER DETECTION
8
作者 关卓威 张晔 《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
Global Dynamic Modeling of Electro-Hydraulic 3-UPS/S Parallel Stabilized Platform by Bond Graph 被引量:11
9
作者 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
The Cordiality on the Union of 3-regular Connected Graph and Cycle 被引量:3
10
作者 XIE Yan-tao CHE Ying-tao LIU Zhi-shan 《Chinese Quarterly Journal of Mathematics》 CSCD 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
A POLYNOMIAL ALGORITHM FOR FINDING THEMINIMUM FEEDBACK VERTEX SET OF A3-REGULAR SIMPLE GRAPH 被引量:2
11
作者 李德明 刘彦佩 《Acta Mathematica Scientia》 SCIE CSCD 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
Construction of fault diagnosis system for control rod drive mechanism based on knowledge graph and Bayesian inference 被引量:3
12
作者 Xue‑Jun Jiang Wen Zhou Jie Hou 《Nuclear Science and Techniques》 SCIE EI CAS CSCD 2023年第2期58-75,共18页
Knowledge graph technology has distinct advantages in terms of fault diagnosis.In this study,the control rod drive mechanism(CRDM)of the liquid fuel thorium molten salt reactor(TMSR-LF1)was taken as the research objec... Knowledge graph technology has distinct advantages in terms of fault diagnosis.In this study,the control rod drive mechanism(CRDM)of the liquid fuel thorium molten salt reactor(TMSR-LF1)was taken as the research object,and a fault diagnosis system was proposed based on knowledge graph.The subject–relation–object triples are defined based on CRDM unstructured data,including design specification,operation and maintenance manual,alarm list,and other forms of expert experience.In this study,we constructed a fault event ontology model to label the entity and relationship involved in the corpus of CRDM fault events.A three-layer robustly optimized bidirectional encoder representation from transformers(RBT3)pre-training approach combined with a text convolutional neural network(TextCNN)was introduced to facilitate the application of the constructed CRDM fault diagnosis graph database for fault query.The RBT3-TextCNN model along with the Jieba tool is proposed for extracting entities and recognizing the fault query intent simultaneously.Experiments on the dataset collected from TMSR-LF1 CRDM fault diagnosis unstructured data demonstrate that this model has the potential to improve the effect of intent recognition and entity extraction.Additionally,a fault alarm monitoring module was developed based on WebSocket protocol to deliver detailed information about the appeared fault to the operator automatically.Furthermore,the Bayesian inference method combined with the variable elimination algorithm was proposed to enable the development of a relatively intelligent and reliable fault diagnosis system.Finally,a CRDM fault diagnosis Web interface integrated with graph data visualization was constructed,making the CRDM fault diagnosis process intuitive and effective. 展开更多
关键词 CRDM Knowledge graph Fault diagnosis Bayesian inference RBT3-TextCNN Web interface
下载PDF
SCORE SETS IN ORIENTED 3-PARTITE GRAPHS
13
作者 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
The L(3,2,1)-labeling on Bipartite Graphs
14
作者 YUAN WAN-LIAN ZHAI MING-QING Lǔ CHANG-HONG 《Communications in Mathematical Research》 CSCD 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
15
作者 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
全局3-彩虹控制数与3-彩虹控制数之差为2和3的树的刻画
16
作者 郝国亮 曾淑婷 +1 位作者 庄蔚 谢智红 《大连理工大学学报》 CAS CSCD 北大核心 2023年第5期544-550,共7页
对于任意正整数k,图G的k-彩虹控制函数f定义为从图G的顶点集V到集合{1,2,…,k}的幂集的映射,使得任意满足f(u)=的顶点u,都有∪_(x∈N(u))f(x)={1,2,…,k},其中N(u)是u的开邻域.图G的k-彩虹控制函数f的权为∑_(x∈V(G))f(x).如果f是图G... 对于任意正整数k,图G的k-彩虹控制函数f定义为从图G的顶点集V到集合{1,2,…,k}的幂集的映射,使得任意满足f(u)=的顶点u,都有∪_(x∈N(u))f(x)={1,2,…,k},其中N(u)是u的开邻域.图G的k-彩虹控制函数f的权为∑_(x∈V(G))f(x).如果f是图G及其补图的k-彩虹控制函数,则称f是图G的全局k-彩虹控制函数.图G的k-彩虹控制数γr k(G)和全局k-彩虹控制数γ_(grk)(G)分别指图G的所有k-彩虹控制函数和所有全局k-彩虹控制函数的最小权.2016年,Amjadi等刻画了γ_(gr2)(T)-γ_(r2)(T)=1和γ_(gr2)(T)-γ_(r2)(T)=2成立的所有树T.在此基础上,通过对图的结构分析,利用分类讨论法完全刻画了γ_(gr3)(T)-γ_(r3)(T)=2和γ_(gr3)(T)-γ_(r3)(T)=3成立的所有树T,推广了Amjadi等的结果. 展开更多
关键词 3-彩虹控制 全局3-彩虹控制 补图 刻画
下载PDF
3D scene graph prediction from point clouds
17
作者 Fanfan WU Feihu YAN +1 位作者 Weimin SHI Zhong ZHOU 《Virtual Reality & Intelligent Hardware》 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
4p^(2)阶广义四元数群的连通3度Cayley图
18
作者 池建成 《广西民族大学学报(自然科学版)》 CAS 2023年第4期80-84,94,共6页
对于有限群G,通过下列方式构造群G的Cayley图:V(Г)=G,E(Г)={(g,sg)|g∈G,s∈S}。文章对4p^(2)阶广义四元数群的三元生成子集给出分类,通过查圈的方法得出两种同构类Cayley图是非正规的,其余皆是正规的结论。
关键词 广义四元数群 CAYLEY图 正规性 3
下载PDF
3-正则3-连通图的圈上的可去边分布
19
作者 覃城阜 杨海玲 梁宇 《南宁师范大学学报(自然科学版)》 2023年第2期7-10,共4页
设G是k-连通图,e是G的一条边,由G-e经过删除度为k-1的顶点u,并用完全图K_(k-1)代替导出子图(G-e)[N(u)]得到的图记为G■e.若G■e仍是k-连通的,则称e是可去边.该文证明了3-正则3-连通图的最长圈至少有4条可去边,且有无穷多的例子说明这... 设G是k-连通图,e是G的一条边,由G-e经过删除度为k-1的顶点u,并用完全图K_(k-1)代替导出子图(G-e)[N(u)]得到的图记为G■e.若G■e仍是k-连通的,则称e是可去边.该文证明了3-正则3-连通图的最长圈至少有4条可去边,且有无穷多的例子说明这个界可达到. 展开更多
关键词 3-正则3-连通图 可去边
下载PDF
图P_n^3的优美标号 被引量:32
20
作者 邓怀敏 林育青 《新疆大学学报(自然科学版)》 CAS 2000年第2期12-16,共5页
定义了图 P3 n,证明了当 n =6 k +2及 n =6 k +4时 ,图 P3 n是优美图 ,并得到它们的优美标号 ,其中 k是任意自然数 .
关键词 优美图 优美标号 P^3n图 图论
下载PDF
上一页 1 2 14 下一页 到第
使用帮助 返回顶部