Affiliation:
1. College of Mathematics and Information Science, Henan Normal University, Xinxiang 453007, China
Abstract
In this paper, we mainly investigate graphs with a small (strong) proper connection number and a large clique number. First, we discuss the (strong) proper connection number of a graph G of order n and ω(G)=n−i for 1⩽i⩽3. Next, we investigate the rainbow connection number of a graph G of order n, diam(G)≥3 and ω(G)=n−i for 2⩽i⩽3.
Funder
Foundation of Henan Educational Committee
Subject
Geometry and Topology,Logic,Mathematical Physics,Algebra and Number Theory,Analysis