Let mij(G) be the number of edges of graph G, connecting vertices of degrees i and j. Necessary and sufficient conditions are established on a symmetric matrix M of type Δ × Δ such that there is a tree T for which Mij = mij(T) holds for all i, j
AbstractLet n, b, d be positive integers. We evaluate f(n, b, d), the largest possible number of edg...
AbstractThe degree profile of an edge e of a finite hypergraph H is the map assigning to a positive ...
AbstractLet G be a minimally k-edge-connected simple graph and vk(G) be the number of vertices of de...
AbstractThe note contains some conditions on a graph implying that the edge connectivity is equal to...
Research supported in part by Fundação para a Ciência e a Tecnologia, Portugal, through the research...
AbstractIt was conjectured that for each simple graph G=(V,E) with n=|V(G)| vertices and m=|E(G)| ed...
AbstractIn this paper it is proved that for any fixed r and k the number T(G; n, k) of spanning tree...
In this paper, necessary and sufficient conditions are given for the existence of molecular graph(s)...
In this paper, necessary and sufficient conditions are given for the existence of molecular graph(s)...
Let $\lambda(G)$ denote the smallest number of vertices that can be removed from a non-empty graph $...
AbstractA tree decomposition of a graph G is a family of subtrees whose sets of edges partition the ...
AbstractThe least (and greatest) number of edges realizable by a graph having n vertices and automor...
For a simple graph G on n vertices, a real symmetric nxn matrix A is said to be compatible with G, i...
AbstractThe connectivity index wα(G) of a graph G is the sum of the weights (d(u)d(v))α of all edges...
The Erdös–Sós conjecture says that a graph G on n vertices and number of edges e(G) > n(k − 1)/2 co...
AbstractLet n, b, d be positive integers. We evaluate f(n, b, d), the largest possible number of edg...
AbstractThe degree profile of an edge e of a finite hypergraph H is the map assigning to a positive ...
AbstractLet G be a minimally k-edge-connected simple graph and vk(G) be the number of vertices of de...
AbstractThe note contains some conditions on a graph implying that the edge connectivity is equal to...
Research supported in part by Fundação para a Ciência e a Tecnologia, Portugal, through the research...
AbstractIt was conjectured that for each simple graph G=(V,E) with n=|V(G)| vertices and m=|E(G)| ed...
AbstractIn this paper it is proved that for any fixed r and k the number T(G; n, k) of spanning tree...
In this paper, necessary and sufficient conditions are given for the existence of molecular graph(s)...
In this paper, necessary and sufficient conditions are given for the existence of molecular graph(s)...
Let $\lambda(G)$ denote the smallest number of vertices that can be removed from a non-empty graph $...
AbstractA tree decomposition of a graph G is a family of subtrees whose sets of edges partition the ...
AbstractThe least (and greatest) number of edges realizable by a graph having n vertices and automor...
For a simple graph G on n vertices, a real symmetric nxn matrix A is said to be compatible with G, i...
AbstractThe connectivity index wα(G) of a graph G is the sum of the weights (d(u)d(v))α of all edges...
The Erdös–Sós conjecture says that a graph G on n vertices and number of edges e(G) > n(k − 1)/2 co...
AbstractLet n, b, d be positive integers. We evaluate f(n, b, d), the largest possible number of edg...
AbstractThe degree profile of an edge e of a finite hypergraph H is the map assigning to a positive ...
AbstractLet G be a minimally k-edge-connected simple graph and vk(G) be the number of vertices of de...
DOI
Add to ORKG