• No results found

k-edge-connected graph

Approximation Algorithms for Connected Graph Factor Problems

Approximation Algorithms for Connected Graph Factor Problems

... any k-edge-connected graph G can be transformed into a graph with maximum degree k + 1 without increasing its ...cost k-edge-connected spanning subgraph ...

50

SACK: Anonymization of Social Networks by Clustering of K edge connected Subgraphs

SACK: Anonymization of Social Networks by Clustering of K edge connected Subgraphs

... a graph, individuals are represented as nodes of ...like K-anonymity, which is a widely used privacy model for data ...anonymization. K-anonymity was first presented in [1], [2] and is used in ...

7

Cutting-edge Relational Graph Data Management with Edge-k: From One to Multiple Edges in the Same Row

Cutting-edge Relational Graph Data Management with Edge-k: From One to Multiple Edges in the Same Row

... compare Edge-k to Neo4j and to the conventional edge ...fewer connected elements to be joined during the iterations of Algorithm ...conventional edge table, and the Edge-k ...

16

Reaching consensus on a connected graph

Reaching consensus on a connected graph

... are k of these. Each of these k ends has a distance to the nearest active vertex given by a geometric random variable, and these variables are independent since the paths are ...probability k ≥ ...

26

k-Intersection Graph of a Finite Set

k-Intersection Graph of a Finite Set

... of k foreigners and n − k ...a k-intersection graph with parameters n, m and ...are connected if the corresponding companies have at least one native investor in ...

13

EDGE DOMINATION IN BOOLEAN FUNCTION GRAPH B(G, L(G), NINC) OF A GRAPH

EDGE DOMINATION IN BOOLEAN FUNCTION GRAPH B(G, L(G), NINC) OF A GRAPH

... an edge dominating set of G if every edge not in F is adjacent to some edge in ...The edge domination number (G) of G is the minimum cardinality taken over all edge dominating sets of ...

5

A Note on Acyclic Edge Colouring of Star Graph Families

A Note on Acyclic Edge Colouring of Star Graph Families

... proper edge colouring f of a graph G is called acyclic if there are no bichromatic cycles in the ...acyclic edge chromatic number or acyclic chromatic index, denoted by a G ′ ( ) , is the minimum ...

5

On r Edge Connected r Regular Bricks and Braces and Inscribability

On r Edge Connected r Regular Bricks and Braces and Inscribability

... a graph is isomorphic to the graph of some 3-dimensional polytope P if and only if it is planar and ...a graph G is isomorphic to the graph of a 3-dimensional polytope inscribed in a sphere, ...

9

Paired, Total, and Connected Domination on the Queen’s Graph Revisited

Paired, Total, and Connected Domination on the Queen’s Graph Revisited

... queen’s graph has a long and rich history, first having been posed by Ahrens in 1910 ...and connected domination on the queen’s graph, denoted γ t ( ) Q n , γ pr ( ) Q n , ...

6

Total Edge Dominating Functions of Corona Product Graph of a Cycle with a Complete Graph

Total Edge Dominating Functions of Corona Product Graph of a Cycle with a Complete Graph

... complete graph is a graph obtained by taking one copy of a – vertex graph and copies of and then joining the vertex of to every vertex of copy of ...This graph is denoted by ...

5

The Upper Total Edge Domination Number of a Graph

The Upper Total Edge Domination Number of a Graph

... basic graph theoretic terminology, we refer to Chartrand ...a graph if < ( )> is complete. If = { , } is an edge of a graph with ( ) = 1and ( ) > 1, then we call a pendent ...

6

The upper connected vertex detour monophonic number of a graph

The upper connected vertex detour monophonic number of a graph

... upper connected x-detour monophonic number of G, denoted by cdm + x (G), is defined to be the maximum cardinality of a minimal connected x-detour monophonic set of ...and k with 2 ≤ r ≤ d and ...

15

Effective elliptic arc selection from connected edge points

Effective elliptic arc selection from connected edge points

... Figure 6(4) is an example which includes a line segment as outlier points. All methods fitted an almost correct ellipse. In Fig. 6(4), since Yu’s method fitted an ellipse to a short arc, the accuracy of the resulting ...

11

Dust absorption and scattering in the silicon K-edge

Dust absorption and scattering in the silicon K-edge

... In Figure 4 the best fitting dust mixtures of all nine X-ray binaries considered here are indicated by the green bars. On the x-axis we show the numbers belonging to each dust sample (see Table 1). The y-axis indicates ...

18

Signed (b,k) Edge Covers in Graphs

Signed (b,k) Edge Covers in Graphs

... We consider a variant of the standard edge cover problem. Let G be a graph with vertex set and edge set . We use [6] for terminology and notation which are not defined here and consider only simple ...

6

Temperature Dependence of the K Absorption Edge of Lithium

Temperature Dependence of the K Absorption Edge of Lithium

... There is a marked increase of the width of the edge with increasing temperature above 293 K, indicating that the lattice plays a major role in the broadening of the edge.. photoyield, em[r] ...

5

A Hamiltonian cycle in the square of a 2 connected graph in linear time

A Hamiltonian cycle in the square of a 2 connected graph in linear time

... undirected graph G G such that for every vertex v having two incoming edges vw, vz, these edges are consecutive in ...wz edge for every vertex v having two incoming edges, then finding an Euler tour in the ...

6

Total Signed And Roman Edge Dominating Functions of Corona Product Graph of A Cycle With A Complete Graph

Total Signed And Roman Edge Dominating Functions of Corona Product Graph of A Cycle With A Complete Graph

... product graph are studied by Anita [2] and some results on minimal edge dominating sets and functions of this graph are presented in ...Roman edge dominating functions of this graph are ...

8

Neighborhood and Efficient Triple Connected Domination Number of a Fuzzy Graph

Neighborhood and Efficient Triple Connected Domination Number of a Fuzzy Graph

... fuzzy graph G is said to be a Neighborhood triple Connected dominatingset, if S is a dominating set and the induced sub graph < N(S) > is a triple ...triple Connected dominating sets is ...

8

CONNECTED WEIGHT DOMINATING EDGE SET ON S - VALUED GRAPHS

CONNECTED WEIGHT DOMINATING EDGE SET ON S - VALUED GRAPHS

... An edge dominating set X of is called a connected edge dominating set of G if the induced subgraph X is ...The connected edge domination number  c    G (or  c  for short ) of G is ...

10

Show all 10000 documents...

Related subjects