期刊： GRAPHS AND COMBINATORICS, 2021; 37 (4)
The generalized Turan number ex(n, K-s, H) is defined to be the maximum number of copies of a complete graph K-s in any H-free graph on n vertices. Le......
期刊： GRAPHS AND COMBINATORICS, 2021; 37 (3)
Let G be a connected irregular graph on n vertices with maximum degree D and diameter D. The spectral radius of G, which is denoted by rho(G), is the ......
期刊： GRAPHS AND COMBINATORICS, 2021; 37 (3)
Let G be an irregular graph on n vertices with maximum degree Delta >= 3 and diameter D >= 3. The spectral radius of G, which is denoted by rho(......
期刊： GRAPHS AND COMBINATORICS, 2021; 37 (4)
A set S of vertices is a determining set of a graph G if every automorphism of G is uniquely determined by its action on S. The determining number of ......
期刊： GRAPHS AND COMBINATORICS, 2021; 37 (4)
We give a survey on graphs with fixed smallest adjacency eigenvalue, especially on graphs with large minimal valency and also on graphs with good stru......
期刊： GRAPHS AND COMBINATORICS, 2021; 37 (3)
Zarankiewicz's conjecture states that the crossing number cr(K-m,K-n) of the complete bipartite graph K-m,K-n is Z(m, n) := left perpendicularm/2right......
期刊： GRAPHS AND COMBINATORICS, 2021; 37 (4)
Let H be the digraph with vertex set {1, 2, 3, 4} and arc set {12, 13, 14, 24, 34}. In this paper, we determine the maximum size of H-free digraphs of......
期刊： GRAPHS AND COMBINATORICS, 2021; 37 (3)
It is well known that a graph is bipartite if and only if it contains no odd cycles. Gallai characterized edge colorings of complete graphs containing......
期刊： GRAPHS AND COMBINATORICS, 2021; 37 (3)
An edge-colored graph is called rainbow if all its edges are colored distinct. The anti-Ramsey number of a graph family F in the graph G, denoted by A......
期刊： GRAPHS AND COMBINATORICS, 2021; 37 (4)
A 1-planar graph is a graph which has a drawing on the plane such that each edge has at most one crossing. Czap and Hudak showed that every 1-planar g......
期刊： GRAPHS AND COMBINATORICS, 2021; 37 (4)
The minimum cardinality of a power dominating set of a graph G is the power domination number of G, denoted by gamma(P)(G). We prove a conjecture on p......
期刊： GRAPHS AND COMBINATORICS, 2021; 37 (4)
Let T-n be an arc-colored tournament of order n. The maximum monochromatic indegree Delta(-mon)(T-n) (resp. outdegree Delta(+mon) (T-n)) of T-n is the......
期刊： GRAPHS AND COMBINATORICS, ; ()
A graph G has the strong parity property if for every subset X subset of V(G) with vertical bar X vertical bar even, G has a spanning subgraph F with ......
期刊： GRAPHS AND COMBINATORICS, ; ()
Let D = (V, A) be a digraph of order n, S a subset of V of size k and 2 <= k <= n. A strong subgraph H of D is called an S-strong subgraph if S ......
期刊： GRAPHS AND COMBINATORICS, ; ()
Given two graphs G and H, it is said that G percolates in H-bootstrap process if one could join all the nonadjacent pairs of vertices of G in some ord......
