AbstractLet G be a simple graph of order n without isolated vertices. If the integer h satisfies h ⩾ maxυ ϵ V(G)minu ψ N(V)(degGu) then G is called an Fn(h)-graph. In this note the maximum size of Fn(h)-graphs is determined. A result of Krol and Veldman on critically h-connected graphs follows as a corollary
A well-known fundamental problem in extremal graph theory is the degree/diameter problem, which is t...
We investigate the smallest number λ(G) of vertices that need to be removed from a non-empty graph G...
AbstractLet G be a graph with order n and minimum degree δ(≥2). Erdős et al. found an upper bound of...
Let G be a finite connected graph. We give an asymptotically tight upper bound on the size of G in t...
AbstractThe degree set of a finite simple graph G is the set of distinct degrees of vertices of G. A...
AbstractThe problem of determining the largest order nd,k of a graph of maximum degree at most d and...
A graph is diameter-2-critical if its diameter is two and the deletion of any edge increases the dia...
Let it (G) be the number of independent sets of size t in a graph G. Engbers and Galvin asked how la...
The degree-diameter problem asks for the maximum number of vertices in a graph with maximum degree ∆...
A simple undirected connected graph with minimum degree K is said to be K-restrained. Thus the class...
AbstractA simple undirected connected graph with minimum degree K is said to be K-restrained. Thus t...
AbstractFor a graph G, denote by fk(G) the smallest number of vertices that must be deleted from G s...
We investigate the smallest number λe(G) of edges that can be removed from a non-empty graph G so th...
AbstractWe give asymptotically sharp upper bounds for the maximum diameter and radius of (i) a conne...
International audienceLet $G=(V(G),E(G))$ be a graph. Determining the minimum and/or maximum size $(...
A well-known fundamental problem in extremal graph theory is the degree/diameter problem, which is t...
We investigate the smallest number λ(G) of vertices that need to be removed from a non-empty graph G...
AbstractLet G be a graph with order n and minimum degree δ(≥2). Erdős et al. found an upper bound of...
Let G be a finite connected graph. We give an asymptotically tight upper bound on the size of G in t...
AbstractThe degree set of a finite simple graph G is the set of distinct degrees of vertices of G. A...
AbstractThe problem of determining the largest order nd,k of a graph of maximum degree at most d and...
A graph is diameter-2-critical if its diameter is two and the deletion of any edge increases the dia...
Let it (G) be the number of independent sets of size t in a graph G. Engbers and Galvin asked how la...
The degree-diameter problem asks for the maximum number of vertices in a graph with maximum degree ∆...
A simple undirected connected graph with minimum degree K is said to be K-restrained. Thus the class...
AbstractA simple undirected connected graph with minimum degree K is said to be K-restrained. Thus t...
AbstractFor a graph G, denote by fk(G) the smallest number of vertices that must be deleted from G s...
We investigate the smallest number λe(G) of edges that can be removed from a non-empty graph G so th...
AbstractWe give asymptotically sharp upper bounds for the maximum diameter and radius of (i) a conne...
International audienceLet $G=(V(G),E(G))$ be a graph. Determining the minimum and/or maximum size $(...
A well-known fundamental problem in extremal graph theory is the degree/diameter problem, which is t...
We investigate the smallest number λ(G) of vertices that need to be removed from a non-empty graph G...
AbstractLet G be a graph with order n and minimum degree δ(≥2). Erdős et al. found an upper bound of...
DOI
Add to ORKG