检索结果-南通市图书馆

Super-edge-graceful Labelings of Some cubic graphs

在线全文

学校读者我要写书评

暂无评论

Acta Mathematica Sinica,English Series 2006年第6期22卷 1621-1628页

作者： Wai Chee SHIU Department of Mathematics Hong Kong Baptist University

The notion of super-edge-graceful graphs was introduced by Mitchem and Simoson in ***, few examples except trees are known. In this paper, we exhibit two classes of infinitely many cubic graphs which are super-edge-gr... 详细信息

关键词： super-edge-graceful cubic graph permutation cubic graph permutation Petersen graph,permutation ladder graph

AT MOST SINGLE-BEND EMBEDDINGS OF cubic graphS

在线全文

学校读者我要写书评

暂无评论

Applied Mathematics(A Journal of Chinese Universities) 1994年第2期9卷 127-142页

作者：刘彦佩 Marchioro,P. Petreschi,R. Institute of Applied Mathematics Academia Sinica Beijing Department of Mathematics University of Rome “La Sapienza” Rome Italy

This paper provides the complete proof of the fact that any planar cubic graph isat most slngle-bend embeddable except for the tetrabedrou. An O(n) amortized time algorithm for drawing an at most single-bend embedding of a cubic graph'.is also presented, where n is the number of vertices of the graph. Furthermore, it is proved that the minimum of the total number of bends in an at most slngle-bend embedding of a cubic graph of order n is less than or equal to 0.5n+1. This result is the best possible.

关键词： 05C10 57M50 94C15 cubic graph sb-embedding st-numbering algorithm

On the ｛P_2,P_3｝-Factor of cubic graphs

在线全文

学校读者我要写书评

暂无评论

Journal of Beijing Institute of Technology 2005年第4期14卷 445-448页

作者：缑葵香孙良 School of Science Beijing Institute of Technology Beijing100081 China

Ler G = （ V, E） be a finite simple graph and Pn denote the path of order n. A spanning subgraph F is called a { P2, P3 }-factor of G if each component of F is isomorphic to P2 or P3. With the path-covering method, it is proved that any connected cubic graph with at least 5 vertices has a { P2, P3 }-factor F such that｜P3（F）｜P2（F）｜, where P2（F） and P3（F） denote the set of components of P2 and P3 in F, respectively.

关键词： cubic graph path-factor path covering

Traceability of Subsets in cubic graphs

在线全文

学校读者我要写书评

暂无评论

Systems Science and Systems Engineering 1998年第3期8卷 123-124页

作者： A Yongga & Siqin Department of Mathematics Inner Mongolia Normal University Huhhot 010022, China

If X is a set of 20 vertices of a 3 connected cubic graph, then either every 13 subset of X is traceable or X is traceable in G .

关键词： cubic graph contraction traceable

在线全文

学校读者我要写书评

暂无评论

圈强迫的2-连通无爪三正则图的刻画

Chinese Quarterly Journal of Mathematics 2022年第4期37卷 432-440页

作者：张义冉王秀梅 School of Mathematics and Statistics Zhengzhou UniversityZhengzhou 450001China

Let G be a graph and C be an arbitrary even cycle of *** graph G is called a cycle-forced graph if G-V(C)has a unique perfect *** C is an arbitrary induced even cycle of G,G is called an induced-cycle-forced *** G-V(C)has no perfect matching,G is said to be *** paper gives characterizations of these three type of graphs in the class of 2-connected claw-free cubic graphs.

关键词： Perfect matching cubic graph Claw-free graph Cycle-forced graph

Full Friendly Index Sets of a Family of cubic graphs

同方期刊数据库博看期刊评论

在线全文

学校读者我要写书评

暂无评论

Chinese Quarterly Journal of Mathematics 2021年第3期36卷 221-234页

作者： BAI Yu-jie WU Shu-fei School of Mathematics and Information Science Henan Polytechnic UniversityJiaozuo 454003China

Let G=(V,E)be a *** a vertex labeling f:V→Z2,it induces an edge labeling f+:E→Z2,where for each edge v1 v2∈E we have f+(v1 v2)=f(v1)+f(v2).For each i∈Z2,we use vf(i)(respectively,ef(i))to denote the number of vertices(respectively,edges)with label i.A vertex labeling f of G is said to be friendly if vertices with different labels differ in size by at most *** full friendly index set of a graph G,denoted by F F I(G),consists of all possible values of ef(1)-ef(0),where f ranges over all friendly labelings of *** this paper,motivated by a problem raised by[6],we study the full friendly index sets of a family of cubic graphs.

关键词： Vertex labeling Friendly labeling Embedding labeling graph method cubic graph

ON CLASSES OF REGULAR graphS WITH CONSTANT METRIC DIMENSION

在线全文

学校读者我要写书评

暂无评论

Acta Mathematica Scientia 2013年第1期33卷 187-206页

作者： Muhammad IMRAN Syed Ahtsham ul Haq BOKHARY Ali AHMAD Andrea SEMANIOV-FENOVíKOV Centre for Advanced Mathematics and Physics(CAMP) National University of Sciences and Technology(NUST) Center for Advanced Studies in Pure and Applied Mathematics Bahauddin Zakariya University College of Computer and Information System Jazan University Department of Applied Mathematics and Informatics Technical University

In this paper, we are dealing with the study of the metric dimension of some classes of regular graphs by considering a class of bridgeless cubic graphs called the flower snarks Jn, a class of cubic convex polytopes considering the open problem raised in [M. Imran et al., families of plane graphs with constant metric dimension, Utilitas Math., in press] and finally Harary graphs H5,n by partially answering to an open problem proposed in Ⅱ. Javaid et al., Families of regular graphs with constant metric dimension, Utilitas Math., 2012, 88： 43-57]. We prove that these classes of regular graphs have constant metric dimension.

关键词： metric dimension basis resolving set cubic graph flower snark convexpolytope