Yeo, A.: Relationships between total domination, order, size and maximum degree of graphs. J. Graph Theory 55 (4), 325–337 (2007) MathSciNet MATHYeo, A (2007) Relationships between total domination, order, size and maximum degree of graphs. J. Graph Theory 55: pp. 325-337...
摘要: 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 ...
Finding maximum cliques in arbitrary and in special graphs The classical problem of finding a clique of largest cardinality in an arbitrary graph is NP-complete. For that reason earlier work diverges into two direc... L Babel - 《Computing》 被引量: 121发表: 1991年 On the clique-transversal...
CollectionOfUser EligibleChildResourceInner Get1ItemsItem Get2ItemsItem Get3ItemsItem Get5ItemsItem Get6ItemsItem Get7ItemsItem Get8ItemsItem GroupsOrderby GroupsSelect MicrosoftGraphActionState MicrosoftGraphActivityHistoryItem MicrosoftGraphAddIn MicrosoftGraphAdministrativeUnit MicrosoftGraphAlternativeSecu...
Equality in a Linear Vizing-Like Relation that Relates the Size and Total Domination Number of a Graph 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)...
, size distribution, are all crucial knowledge needs in order to improve the assessment of a species’ population status and for the implementation of effective management strategies (Camhi 1998; Baum et al. 2003; Labrada-Martagón et al. 2014). Traditional methods for the collection of ...
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 ...
An embedding of a graph G ( V, E ) into its complement is a permutation ω on V(G) such that if an edge xy belongs to E(G) then ω( x )ω( y ) does not belong to E(G) . The fact that every graph G of order n and size less than or equal to n 2 is embeddable is ...
resourcegraph.fluent com.azure.resourcemanager.resourcegraph.models com.azure.resourcemanager.resourcegraph.fluent.models com.azure.resourcemanager.resourcegraph com.azure.resourcemanager.resourcehealth.fluent com.azure.resourcemanager.resourcehealth.fluent.models com.azure.resourcemanager.resourcehealth.models com....
J Graph Theory 54: 350–353, 2007 Research partly supported by the National Natural Science Foundation of China and the developing Science Foundation of Shanghai Education Committee. Research supported in part by the South African National Research Foundation and the University of KwaZulu-Natal....