云南高校图书馆联盟文献共享服务平台- CHROMATIC

CHROMATIC_NUMBER: 作品数：36被引量：45H指数：4; 导出分析报告; 相关作者：许克祥宋增民更多>>; 相关机构：东南大学南京航空航天大学更多>>; 相关期刊：《Engineering（科研）》《Acta Mathematica Sinica,English Series》《Journal of Mathematical Research with Applications》《Science China Mathematics》更多>>; 相关基金：国家自然科学基金国家教育部博士点基金广西壮族自治区自然科学基金更多>>

On r-Hued Coloring of Hypercubes: 《新疆大学学报（自然科学版中英文）》2024年第6期651-656,686,共7页FENG Bowen XIONG Wei; supported by Natural Science Foundation of Xinjiang Uygur Autonomous Region of China“Spanning connectivity and supereulerian properties of graphs”(2022D01C410).; For positive integers k and r,a(k,r)-coloring of graph G is a proper vertex k-coloring of G such that the neighbors of any vertex v∈V(G)receive at least min{d_(G)(v),r}different colors.The r-hued chromatic number of ...; 关键词：HYPERCUBE COLORING r-hued chromatic number

The Chromatic Number of(P_(5),HVN)-free Graphs: 《Acta Mathematicae Applicatae Sinica》2024年第4期1098-1110,共13页Yian XU; supported by the National Natural Science Foundation of China(No.12101117);Natural Science Foundation of Jiangsu Province(No.BK20200344)。; Let G be a graph.We useχ(G)andω(G)to denote the chromatic number and clique number of G respectively.A P_(5)is a path on 5 vertices,and an HVN is a K_(4)together with one more vertex which is adjacent to exactly two...; 关键词：P_(5) HVN chromatic number clique number

On the Chromatic Number of (P<sub>5</sub>, C<sub>5</sub>, Cricket)-Free Graphs: 《Engineering（科研）》2022年第3期147-154,共8页Weilun Xu; For a graph G, let be the chromatic number of G. It is well-known that holds for any graph G with clique number . For a hereditary graph class , whether there exists a function f such that holds for every has been wid...; 关键词：P₅-Free Graphs Chromatic Number X-Boundedness

Geodetic Number and Geo-Chromatic Number of 2-Cartesian Product of Some Graphs: 《Open Journal of Discrete Mathematics》2022年第1期1-16,共16页Medha Itagi Huilgol B. Divya; A set S ⊆ V (G) is called a geodetic set if every vertex of G lies on a shortest u-v path for some u, v ∈ S, the minimum cardinality among all geodetic sets is called geodetic numb...; 关键词：Cartesian Product Grid Graphs Geodetic Set Geodetic Number Chromatic Set Chromatic Number Geo-Chromatic Set Geo-Chromatic Number

Chromatic number and subtrees of graphs被引量：1: 《Frontiers of Mathematics in China》2017年第2期441-457,共17页Baogang XU Yingli ZHANG; Acknowledgements The authors thank the referees for their valuable comments. This work was partially supported by the National Natural Science Foundation of China （Grant Nos. 11331003, 11571180） and a Project Funded by the Priority Academic Program Development of Jiangsu Higher Education Institutions.; Let G and H be two induced subgraph isomorphic to conjectured that, for every tree function, depending only on T graphs. We say that G induces H if G has an H. A. Gyarfas and D. Sumner, independently, T, there exists ...; 关键词：Chromatic number clique number induced tree SUBDIVISION

Quasi-Zero-Divisor Graphs of Non-Commutative Rings被引量：1: 《Journal of Mathematical Research with Applications》2017年第2期137-147,共11页Shouxiang ZHAO Jizhu NAN Gaohua TANG; Supported by the National Natural Science Foundation of China(Grant Nos.11371343;11161006;11661014;11171142);the Guangxi Science Research and Technology Development Project(Grant No.1599005-2-13);the Scientic Research Fund of Guangxi Education Department(Grant No.KY2015ZD075);the Natural Science Foundation of Guangxi(Grant No.2016GXSFDA380017); In this paper, a new class of rings, called FIC rings, is introduced for studying quasi-zero-divisor graphs of rings. Let R be a ring. The quasi-zero-divisor graph of R, denoted by Г＊（R）, is a directed graph defin...; 关键词：quasi-zero-divisor zero-divisor graph chromatic number clique number FIC ring

On the Maximum Number of Dominating Classes in Graph Coloring: 《Open Journal of Discrete Mathematics》2016年第2期70-73,共4页Bing Zhou; We investigate the dominating-c-color number,, of a graph G. That is the maximum number of color classes that are also dominating when G is colored using colors. We show that where is the join of G and . This result a...; 关键词：Graph Coloring Dominating Sets Dominating Coloring Classes Chromatic Number Dominating Color Number

Graph Properties and Stratified Presentations of Partially Ordered Sets: 《Algebra Colloquium》2016年第1期51-63,共13页Jin Guo Tongsuo Wu; Supported by the National Natural Science Foundation of China （11271250）.Acknowledgements. The authors express their sincere thanks to the referees for the careful reading and suggestions which improved the exposition of the paper.; In this paper, we introduce some new definitions such as the U＊L＊ condition to describe the zero-divisor graph G = F（P） of a poser P, and give a new and quick proof to a main result in [2, 4]. By deleting a typica...; 关键词：POSET chromatic number clique number deleting method stratified presentation

The Classification of the Annihilating-Ideal Graphs of Commutative Rings被引量：1: 《Algebra Colloquium》2014年第2期249-256,共8页G. Aalipour S. Akbari M. Behboodi R. Nikandish M.J. Nikmehr F. Shaveisi; Let R be a commutative ring and A（R） be the set of ideals with non-zero annihilators. The annihilating-ideal graph of R is defined as the graph AG（R） with the vertex set A（R）＊ = A（R）／{（0）} and two distinct...; 关键词：annihilating-ideal graph clique number chromatic number Artinian ring Noetherian ring

A Lower Bound for the Distance Signless Laplacian Spectral Radius of Graphs in Terms of Chromatic Number被引量：3: 《Journal of Mathematical Research with Applications》2014年第3期289-294,共6页Xiaoxin LI Yizheng FAN Shuping ZHA; Supported by National Natural Science Foundation of China(Grant Nos.11071002;11371028);Program for New Century Excellent Talents in University(Grant No.NCET-10-0001);Key Project of Chinese Ministry of Education(Grant No.210091);Specialized Research Fund for the Doctoral Program of Higher Education(Grant No.20103401110002);Natural Science Research Foundation of Department of Education of Anhui Province(Grant No.KJ2013A196);Scientific Research Fund for Fostering Distinguished Young Scholars of Anhui University(Grant No.KJJQ1001); Let G be a connected graph on n vertices with chromatic number k, and let ρ（G） be the distance signless Laplacian spectral radius of G. We show that ρ（G） ≥ 2n ＋ 2[n/k] - 4, with equality if and only if G is a...; 关键词：distance matrix distance signless Laplacian spectral radius chromatic number.

CHROMATIC_NUMBER