检索结果-南通市图书馆

Colouring of COVID-19 Affected Region Based on Fuzzy Directed Graphs

Computers, Materials & Continua 2021年第7期68卷 1219-1233页

作者： Rupkumar Mahapatra Sovan Samanta Madhumangal Pal Jeong-Gon Lee Shah Khalid Khan Usman Naseem Robin Singh Bhadoria Department of Applied Mathematics with Oceanology and Computer Programming Vidyasagar UniversityMidnapore721102India Department of Mathematics Tamralipta MahavidyalayaTamluk721636India Division of Applied Mathematics Wonkwang UniversityIksan-SiJeonbuk54538Korea School of Engineering RMIT UniversityMelbourne3001Australia School of Computer Science University of Sydney Sydney2006Australia Department of Computer Science&Engineering Birla Institute of Applied Sciences(BIAS)BhimtalUttarakhand263136India

Graph colouring is the system of assigning a colour to each vertex of a *** is done in such a way that adjacent vertices do not have equal *** is fundamental in graph *** is often used to solve real-world problems like traffic light signalling,map colouring,scheduling,***,social networks are prevalent systems in our ***,the users are considered as vertices,and their connections/interactions are taken as *** users follow other popular users’profiles in these networks,and some don’t,but those non-followers are connected directly to the popular *** means,along with traditional relationship(information flowing),there is another relation among *** depends on the domination of the relationship between the *** type of situation can be modelled as a directed fuzzy *** the colouring of fuzzy graph theory,edge membership plays a vital *** membership is a representation of flowing information between end nodes of the *** from the communication relationship,there may be some other factors like domination in *** influence of power is captured *** this article,the colouring of directed fuzzy graphs is defined based on the influence of *** with this,the chromatic number and strong chromatic number are provided,and related properties are *** application regarding COVID-19 infection is presented using the colouring of directed fuzzy graphs.

关键词： Graph colouring chromatic index directed fuzzy graphs

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Edge Coloring of Graphs Embedded in a Surface of Nonnegative Characteristic

引用

Acta Mathematicae Applicatae Sinica 2017年第3期33卷 709-716页

作者： Yi-qiao WANG School of Management Beijing University of Chinese MedicineBeijing 100029China

Let G be a graph embeddable in a surface of nonnegative characteristic with maximum degree six. In this paper, we prove that if G contains no a vertex v which is contained in all cycles of lengths from 3 to 6, then G ... 详细信息

关键词： embedded Graph chromatic index cycle class 1

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

BOUNDS ON THE LOWER SIZE OF A 7-CRITICAL GRAPH

引用

Acta Mathematicae Applicatae Sinica 1994年第4期10卷 411-413,141+415-418页

作者：刘焕平张忠辅沈德安 1. Department of Mathematics Harbin Normal University 150080 Harbin China 2. Department of Mathematics Lanzhou Railway Institute 730070 Lanzhou China 3. Harbin Electrical Technology Institute 150040 Harbin China

In this paper, the authors have obtained some lower bounds on the size of a 7-critical graph,and some results about the planar graph conjecture have been given.

关键词： Edge-coloring chromatic index Δ-critical graph planar conjecture

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Several Sufficient Conditions for Class I

引用

Journal of Systems Science and Systems Engineering 2001年第1期13卷 117-120页

作者： LI Xiao dong1, Wang Yu wen2 1.Harbin Institute, Harbin 150086, China 2.Harbin Normal University, Harbin 150080, China Harbin Institute Harbin 150086 China Harbin Normal University Harbin 150080 China

：Several sufficient conditions for Class I are given in this paper.

关键词： graph theory chromatic index edge colourings

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

The Erdös-Faber-Lovász Conjecture for Gap-Restricted Hypergraphs

引用

Engineering（科研） 2024年第2期16卷 47-59页

作者： Zhimin Wang School of Mathematics and Statistics Shandong Normal University Jinan China

An edge coloring of hypergraph H is a function such that holds for any pair of intersecting edges . The minimum number of colors in edge colorings of H is called the chromatic index of H and is denoted by . Erdös, Faber and Lovász proposed a famous conjecture that holds for any loopless linear hypergraph H with n vertices. In this paper, we show that is true for gap-restricted hypergraphs. Our result extends a result of Alesandroni in 2021.

关键词： Linear Hypergraph chromatic index Erdös-Faber-Lovász Conjecture Edge Cardinality

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

欢迎您,

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：