检索结果-南通市图书馆

regular and Maximal graphs with Prescribed Tripartite graph as a Star Complement

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Chinese Annals of Mathematics,Series B 2023年第4期44卷 517-532页

作者： Xiaona FANG Lihua YOU School of Mathematical Sciences South China Normal UniversityGuangzhou 510631China

Let G be a graph of order n andμbe an adjacency eigenvalue of G with multiplicity k≥1.A star complement H forμin G is an induced subgraph of G of order n-k with no eigenvalueμ,and the subset X=V(G-H)is called a star set forμin *** star complement provides a strong link between graph structure and linear *** this paper,the authors characterize the regular graphs with K2,2,s(s≥2)as a star complement for all possible eigenvalues,the maximal graphs with K2,2,s as a star complement for the eigenvalueμ=1,and propose some questions for further research.

关键词： Adjacency eigenvalue Star set Star complement regular graph Maximal graph

The Existence of Even regular Factors of regular graphs on the Number of Cut Edges

在线全文

学校读者我要写书评

暂无评论

Acta Mathematica Sinica,English Series 2010年第12期26卷 2305-2312页

作者： Hong Bing FAN Gui Zhen LIU Ji Ping LIU He Ping LONG Department of Computer Science Wilfrid Laurier University Waterloo ON N2L 3C5 Canada School of Mathematics Shandong University Ji'nan 250100 P. R. China Department of Computer Science University of Lethbridge Lethbridge AB. T1K 3M4 Canada

For any even integer k and any integer i, we prove that a （kr ＋i）-regular multigraph contains a k-factor if it contains no more than kr - 3k/2＋ i ＋ 2 cut edges, and this result is the best possible to guarantee the existence of k-factor in terms of the number of cut edges. We further give a characterization for k-factor free regular graphs.

关键词： regular graph factor cut edge

Vertex-antimagic Labelings of regular graphs

在线全文

学校读者我要写书评

暂无评论

Acta Mathematica Sinica,English Series 2012年第9期28卷 1865-1874页

作者： Ali AHMAD Kashif ALI Martin BACA Petr KOVAR Andrea SEMANICOVA-FENOVCíKOVA College of Computer Science and Information Systems Jazan University Faculty of Mathematics COMSATS Institute of Information Technology Department of Applied Mathematics and Informatics Technical University Department of Applied Mathematics VB-Technical University of Ostrava

Let G = （V, E） be a finite, simple and undirected graph with p vertices and q edges. An （a, d）-vertex-antimagic total labeling of G is a bijection f from V（G） t2 E（G） onto the set of consecutive integers 1, 2,... ,p ＋ q, such that the vertex-weights form an arithmetic progression with the initial term a and difference d, where the vertex-weight of x is the sum of the value f（x） assigned to the vertex x together with all values f（xy） assigned to edges xy incident to x. Such labeling is called super if the smallest possible labels appear on the vertices. In this paper, we study the properties of such labelings and examine their existence for 2r-regular graphs when the difference d is 0, 1,..., r ＋ 1.

关键词： Super vertex-antimagic total labeling vertex-antimagic edge labeling regular graph

The Ferry Cover Problem on regular graphs and Small-Degree graphs

在线全文

学校读者我要写书评

暂无评论

Chinese Annals of Mathematics,Series B 2018年第6期39卷 933-946页

作者： Erfang SHAN Liying KANG School of Management Shanghai University Shanghai 200444 China Department of Mathematics Shanghai University Shanghai 200444 China

The ferry problem may be viewed as generalizations of the classical wolf-goatcabbage puzzle. The ferry cover problem is to determine the minimum required boat capacity to safely transport n items represented by a conflict graph. The Alcuin number of a conflict graph is the smallest capacity of a boat for which the graph possesses a feasible ferry schedule. In this paper the authors determine the Alcuin number of regular graphs and graphs with maximum degree at most five.

关键词： graph Alcuin number Ferry problem Vertex cover regular graph

k-Factors in regular graphs

在线全文

学校读者我要写书评

暂无评论

Acta Mathematica Sinica,English Series 2008年第7期24卷 1213-1220页

作者： Wai Chee SHIU Gui Zhen LIU Department of Mathematics Hong Kong Baptist University Hong Kong P. R. China School of Mathematics and Systems Science Shandong University Ji'nan P. R. China

Plesnik in 1972 proved that an （m - 1）-edge connected m-regular graph of even order has a 1-factor containing any given edge and has another 1-factor excluding any given m - 1 edges. Alder et al. in 1999 showed that if G is a regular （2n ＋ 1）-edge-connected bipartite graph, then G has a 1-factor containing any given edge and excluding any given matching of size n. In this paper we obtain some sufficient conditions related to the edge-connectivity for an n-regular graph to have a k-factor containing a set of edges and （or） excluding a set of edges, where 1 ≤ k ≤n/2. In particular, we generalize Plesnik＇s result and the results obtained by Liu et al. in 1998, and improve Katerinis＇ result obtained 1993. Furthermore, we show that the results in this paper are the best possible.

关键词： regular graph k-factor edge-connectivity

The Non-Inclusive Diagnosability of regular graphs

在线全文

学校读者我要写书评

暂无评论

Journal of the Operations Research Society of China 2023年第4期11卷 891-910页

作者： Yu-Long Wei Tong-Tong Ding Min Xu School of Mathematical Sciences Beijing Normal UniversityLaboratory of Mathematics and Complex SystemsMinistry of EducationBeijing100875China Department of Mathematics Taiyuan University of TechnologyTaiyuan030024China

Fault diagnosis is an important area of study with regard to the design and maintenance of multiprocessor systems.A new measure for fault diagnosis of systems,namely,non-inclusive diagnosability(denoted by MM^(*)),was proposed by Ding et *** this paper,we establish the non-inclusive diagnosability of a class of regular graphs under the PMC model and the MM^(*)*** applications,the non-inclusive diagnosabilities of hypercubes,hierarchical hypercubes,folded hypercubes,star graphs,bubble-sort graphs,pancake graphs and dual cubes are determined under the PMC model and the[Math Processing Error]model.

关键词： PMC model MM^(*)model regular graph Fault diagnosability

Upper Minus Total Domination Number of regular graphs

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Acta Mathematicae Applicatae Sinica 2017年第1期33卷 69-74页

作者： Zhen-lin LI Xin-zhong LV Department of Mathematics Zhejiang Normal University Jinhua 321004 China

Let Гt-（G） be upper minus total domination number of G. In this paper, We establish an upper bound of the upper minus total domination number of a regular graph G and characterize the extremal graphs attaining the ... 详细信息

关键词： upper minus total domination regular graph

Bounds on the clique-transversal number of regular graphs

在线全文

学校读者我要写书评

暂无评论

Science China Mathematics 2008年第5期51卷 851-863页

作者： CHENG T.C.E Department of Logistics The Hong Kong Polytechnic University

A clique-transversal set D of a graph G is a set of vertices of G such that D meets all cliques of G. The clique-transversal number, denoted τ c (G), is the minimum cardinality of a clique-transversal set in G. In this paper we present the bounds on the clique-transversal number for regular graphs and characterize the extremal graphs achieving the lower bound. Also, we give the sharp bounds on the clique-transversal number for claw-free cubic graphs and we characterize the extremal graphs achieving the lower bound.

关键词： graph regular graph claw-free cubic graph clique-transversal set clique-transversal number 05C65 05C69 05C75

ON THE ASCENDING SUBgraph DECOMPOSITIONS OF regular graphS

在线全文

学校读者我要写书评

暂无评论

Applied Mathematics(A Journal of Chinese Universities) 1998年第2期13卷 165-170页

作者： CHENHUAITANG MAKEJIE DepartmentofMathematics LinyiTeacher＇sCollegeLinyi276005 InstituteofOperationsResearch QufuNormalUniversityQufu273165

The definition of the ascending subgraph decomposition was given by Alavi. It has been conjectured that every graph of positive size has an ascending subgraph decomposition. In this paper it is proved that the regular... 详细信息

关键词： Ascending subgraph decomposition regular graph induced subgraph