Volkmann.Minimum size of a graph or digraph of givenradius. Inform Process. Lett . 2009P. Dankelmann and L. Volkmann, Minimum size of a graph or digraph of given radius, Inform. Process. Lett. 109(16) (2009), 971-973.P. Dankelmann,,L. Volkmann.Minimum size of a graph or ...
Maximum Size of a Graph with Given Fractional Matching Number For three integers n, k, d, we determine the maximum size of a graph on n vertices with fractional matching number k and maximum degree at most d. As a con... T Ma,J Qian,C Shi - 《Electronic Journal of Combinatorics》 ...
Given a graph G, the problem is to determine an acyclic orientation of G which minimizes the maximal number of changes of orientation along any shortest path in G. The corresponding value is called the rank of the graph G. The motivation for this graph theoretical problem comes from the desi...
Summary: Let $G$ be a simple graph of order $n$ and size $m$ which is not a tree. If $\\ell\\ge 3$ is a natural number and the length of every cycle of $G$ is divisible by $\\ell$, then $m\\le{\\ell\\over\\ell- 2}(n-2)$, and the equality holds if and only ...
摘要: For the independence number α( G) of a connected graph G on n vertices with m edges the inequality α(G)⩾ 1 2[(2m+n+1)− (2m+n+1) 2−4n 2] is proved and its algorithmic realization is discussed.关键词:Independence Stability ...
Sum-of-squares lower bounds for planted clique Finding cliques in random graphs and the closely related "planted" clique variant, where a clique of size k is planted in a random G(n, 1/2) graph, have be... R Meka,A Potechin,A Wigderson - 《Computer Science》 被引量: 34发表: 2015...
Let $G$ be a graph each component of which has order at least 3, and let $G$\nhave order $n$, size $m$, total domination number $\\gamma_t$ and maximum degree\n$\\Delta(G)$. Let $\\Delta = 3$ if $\\Delta(G) = 2$ and $\\Delta = \\Delta (G... MA Henning,EJ ...
public Integer memoryInMB() Get the memoryInMB property: The amount of memory, in MB, supported by the virtual machine size. Returns: the memoryInMB value.name public String name() Get the name property: The name of the virtual machine size. Returns: the name value.number...
Hence the degree tail does not play the same crucial role for the size of the giant as it does for many other properties of the graph. 展开 关键词: Configuration model Component size Degree distribution DOI: 10.1007/s10955-018-2071-4 年份: 2018 ...
The size Ramsey number ( G ) of a graph G is the smallest integer such that there is a graph F of edges with the property that any two-coloring of the edges of F yields a monochromatic copy of G . First we show that the size Ramsey number ( Pn ) of the path Pn of length n ...