[PDF] Top 20 Responsabilidad Social de la Empresa Del Dicho al Hecho: Anales
Has 10000 "Responsabilidad Social de la Empresa Del Dicho al Hecho: Anales" found on our website. Below are the top 20 most common "Responsabilidad Social de la Empresa Del Dicho al Hecho: Anales".
Minimum Tenacity of Toroidal graphs
... of tenacity of a graph G was introduced in [4,5], as a useful measure of the ”vulnerability” of ...calculated tenacity of the first and second case of the Harary Graphs but they didn’t show the ... See full document
13
On the tenacity of cycle permutation graph
... undirected graphs without loops and multiple ...The minimum degree δ(G), the maximum degree ∆(G), connectivity κ(G), the independence number β(G), the number of components ω(G) and the toughness ... See full document
28
Normalized Tenacity and Normalized Toughness of Graphs
... complete graphs, the minimum is taken over all S ⊂ V (G) which leads to p(G) − 1 instead of ∞; in which, p(G) is the order of ...the minimum Toughness, the graph must be decomposed so that there ... See full document
48
Tenacity and some related results
... of tenacity of a graph G was introduced as a useful measure of the ”vul- nerability” of ...and tenacity for several classes of ...that tenacity is a most suitable measure of stability or ... See full document
41
The edge tenacity of a split graph
... the minimum is taken over every edge-cutset X that separates G into ω(G − X) components, and by τ (G − X) we denote the order of a largest component of ...with minimum vertex degree δ(G) we prove that if ... See full document
9
Diameter Two Graphs of Minimum Order with Given Degree Set
... 2-sc graphs in terms of the degree sets, where for a given graph G the degree set of G, denoted by D(G), is the set of degrees of the vertices of ...the minimum order of such ... See full document
46
Minimum generalized degree distance of n vertex tricyclic graphs
... In (Hamzeh et al. in Stud. Univ. Babe¸s-Bolyai, Chem., 4:73-85, 2012), we introduced a generalization of a degree distance of graphs as a new topological index. In this paper, we characterize the n-vertex ... See full document
6
On Minimum Spanning Subgraphs of Graphs With Proper Connection Number 2
... 2-connected graphs with proper connection number 3 ...connected graphs with proper connection number ...connected graphs with proper connection number 3, the verification of which is more ... See full document
5
Computation of a Minimum Average Distance Tree on Circular-arc Graphs
... arc graphs it is evident that there is at least one arc which is extended on both sides of the fixed line (dotted line in Figure 2) from which order of the arcs ... See full document
5
Identifying codes and searching with balls in graphs
... the minimum number of queries to find an unknown vertex v ∈ G using balls of radius r in the nonadaptive and adaptive searches ...the minimum number of queries to find an unknown vertex v ∈ G using balls ... See full document
16
Graphs without proper subgraphs of minimum degree 3 and short cycles
... The structure of this paper is as follows. In Section 2 we construct our counterexamples to Conjecture 1.1 via proving part (ii) of Theorem 1.3 and Theorem 1.2. In Section 3 we study necessary leaf-leaf path lengths in ... See full document
32
Bounds for the Zero Forcing Number of Graphs with Large Girth
... and minimum zero forcing ...between minimum degree and minimum zero forcing sets remain, since the minimum degree appears in all of presented ... See full document
7
Non linear instabilities in the edge of tokamak plasmas : characterization of edge localized modes and numerical simulation of blob dynamics using a hybrid model
... and poloidal magnetic field. The safety factor q has a role in determining stability. Higher values of q lead to greater stability. If we follow a given field line many times around the torus a closed flux tube is ... See full document
73
Computation of a Minimum Average Distance Tree on Permutation Graphs
... A minimum average distance spanning tree of G is a spanning tree of G with minimum average ...a minimum routing cost spanning ...a minimum average distance spanning tree on permutation ... See full document
45
An Alternative Approach to Counting Minimum (s; t)-cuts in Planar Graphs
... The process to create G b is as follows. A maximum flow must be found within G such that the direct flow edges form no cycles. The residual graph resulting from this process is what will be used moving forward. Because ... See full document
77
Tenacious Graph is NP-hard
... and tenacity for several classes of ...that tenacity is a most suitable measure of stability or vulnerability in that for many graphs it is best able to distinguish between graphs that ... See full document
13
Minimum saturated subgraphs of tripartite graphs
... numbers when the host graph is a complete multipartite whose partite sets are finite. In particular they examined the edge densities where a graph can no longer be triangle-free. If only the edge count was considered ... See full document
86
Tenacity and some other Parameters of Interval Graphs can be computed in polynomial time
... In [[7] - [14]] Moazzami studied more about this parameter. Conceptually graph vulner- ability relates to the study of graph intactness when some of its elements are removed. The motivation for studying vulnerability ... See full document
384
Edge-tenacity in Networks
... and tenacity for several classes of ...that tenacity is a most suitable measure of stability or vulnerability in that for many graphs it is best able to distinguish between graphs that ... See full document
22
Tenacity and rupture degree parameters for trapezoid graphs
... trapezoid graphs. In this paper, it is shown that for these graphs, tenacity and rupture degree parameters can also be computed in poly- nomial ... See full document
9
Related subjects