connected graph
Approximation Algorithms for Connected Graph Factor Problems
... They proved that any k-edge-connected graph G can be transformed into a graph with maximum degree k + 1 without increasing its cost. As we already noted there exists a 2-approximation algorithm for ...
50
Reaching consensus on a connected graph
... complete graph instance of our problem. The idea is that the underlying connected graph allows for modelling a spatial aspect of the problem at ...complete graph case in ...
26
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 ...auxiliary graph G − , and finally replacing the new edge wz by the pair wv, vz for every ...
6
On The Lattice of Trail Sets of a Connected Graph
... directed graph G together with empty set partially ordered by set inclusion relation forms a complete semimodular, A-regular ...finite connected graph together with empty set partially ordered by set ...
11
Double-simulated annealing model for mapping of graphs to single-row networks
... Connected graph is a graph where every pair of distinct vertices in the graph is connected either directly or ...the connected graph representations, such as ...
14
A framework of filtering, clustering and dynamic layout graphs for visualization
... before, graph filtering involves in the selection of nodes and edges from a graph according to whether the values of their attributes fall within a specified ...a graph is to visually represent ...
10
The detour hull number of a graph
... a connected graph G is a detour vertex if it belongs to every minimum detour set of ...the graph H in Figure 2, the set S = {u, v, w} is the unique detour set of H and so w is a detour vertex of ...
16
Vol 7, No 9 (2016)
... trivial connected graph. A subset S of V(G) is called a triple connected dominating set if S is a dominating set and induced sub graph S is triple ...triple connected dominating set is ...
6
Total global neighbourhood domination
... the connected dominating set of G. A dominating set D of connected graph G is called a connected dominating set of G if the induced subgraph hDi is ...The connected domination number of ...
11
Vol 9, No 5 (2018)
... A connected edge detour set of a graph G is a edge detour set S such that the sub graph < S > induced by S is ...a connected edge detour set of G is a connected edge detour ...
7
Nordhaus-Gaddum type results for the Harary index of graphs
... a connected graph also equals the minimum size of a connected subgraph of G containing both and ...a graph, introduced by Chartrand et ...classical graph distance. For a graph ( ...
18
Graphs and Degree Equitability
... Let G V E , be a graph. If is a function from the vertex set V G to the set of positive integers. Then two vertices u v , V G are -equitable if u v 1 . By the degree, equitable ...
5
Path Induced Geodesic Graphs
... a graph 𝐺 = (𝑉, 𝐸), we mean a finite undirected connected graph without loops or multiple ...basic graph theoretic terminology, we refer to Harary 1 ...a connected graph 𝐺 is the ...
8
The upper connected vertex detour monophonic number of a graph
... The concept of vertex geodomination number was introduced in [9] and further studied in [10]. Let x be a vertex of a connected graph G. A set S of vertices of G is an x-geodominating set of G if each vertex ...
15
Yanling
... vertex-colored graph G is rainbow vertex-connected if two vertices are connected by a path whose internal vertices have distinct ...a connected graph G, denoted by rvc(G), is the ...
5
Global outer connected domination number of a graph
... a graph G, denoted by G, is a graph with |V (G)| vertices and two vertices in G are adjacent if and only if they are not adjacent in ...maximal connected subgraph of a graph G named a ...
9
Connection and separation in hypergraphs
... from graph theory, optimization theory, and extremal combinatorics, explaining the fragmented terminology and disjointed nature of the ...to graph theorists, in ...
25
Some New Features and Algorithms for the Study of DFA
... First two numbers in input file are the size of alphabet of labels and the number of vertices. The integers from 0 to n – 1 denote the vertices. i-th row is a list of succes- sors of i-th vertex according to the label in ...
6
Vol 4, No 11 (2013)
... the graph in the Figure 1, V(G) = {1, 2, 3, 4}. Then the connected domination number is one and the connected dominating set of size two are {1, 2}, {2, 3}, {2, 4}, the connected dominating ...
7
CONNECTED WEIGHT DOMINATING EDGE SET ON S - VALUED GRAPHS
... any connected weight dominating edge set is a weight dominating edge set, in which the induced subgraph is ...every connected weight dominating edge set is a weight dominating edge ...
10