Page 1

Displaying 1 – 13 of 13

Showing per page

Geodetic sets in graphs

Gary Chartrand, Frank Harary, Ping Zhang (2000)

Discussiones Mathematicae Graph Theory

For two vertices u and v of a graph G, the closed interval I[u,v] consists of u, v, and all vertices lying in some u-v geodesic in G. If S is a set of vertices of G, then I[S] is the union of all sets I[u,v] for u, v ∈ S. If I[S] = V(G), then S is a geodetic set for G. The geodetic number g(G) is the minimum cardinality of a geodetic set. A set S of vertices in a graph G is uniform if the distance between every two distinct vertices of S is the same fixed number. A geodetic set is essential if for...

Graph centers used for stabilization of matrix factorizations

Pavla Kabelíková (2010)

Discussiones Mathematicae Graph Theory

Systems of consistent linear equations with symmetric positive semidefinite matrices arise naturally while solving many scientific and engineering problems. In case of a "floating" static structure, the boundary conditions are not sufficient to prevent its rigid body motions. Traditional solvers based on Cholesky decomposition can be adapted to these systems by recognition of zero rows or columns and also by setting up a well conditioned regular submatrix of the problem that...

Graph domination in distance two

Gábor Bacsó, Attila Tálos, Zsolt Tuza (2005)

Discussiones Mathematicae Graph Theory

Let G = (V,E) be a graph, and k ≥ 1 an integer. A subgraph D is said to be k-dominating in G if every vertex of G-D is at distance at most k from some vertex of D. For a given class of graphs, Domₖ is the set of those graphs G in which every connected induced subgraph H has some k-dominating induced subgraph D ∈ which is also connected. In our notation, Dom coincides with Dom₁. In this paper we prove that D o m D o m u = D o m u holds for u = all connected graphs without induced P u (u ≥ 2). (In particular, ₂ = K₁ and...

Graphs S ( n , k ) and a variant of the Tower of Hanoi problem

Sandi Klavžar, Uroš Milutinović (1997)

Czechoslovak Mathematical Journal

For any n 1 and any k 1 , a graph S ( n , k ) is introduced. Vertices of S ( n , k ) are n -tuples over { 1 , 2 , ... , k } and two n -tuples are adjacent if they are in a certain relation. These graphs are graphs of a particular variant of the Tower of Hanoi problem. Namely, the graphs S ( n , 3 ) are isomorphic to the graphs of the Tower of Hanoi problem. It is proved that there are at most two shortest paths between any two vertices of S ( n , k ) . Together with a formula for the distance, this result is used to compute the distance between two vertices in...

Graphs with convex domination number close to their order

Joanna Cyman, Magdalena Lemańska, Joanna Raczek (2006)

Discussiones Mathematicae Graph Theory

For a connected graph G = (V,E), a set D ⊆ V(G) is a dominating set of G if every vertex in V(G)-D has at least one neighbour in D. The distance d G ( u , v ) between two vertices u and v is the length of a shortest (u-v) path in G. An (u-v) path of length d G ( u , v ) is called an (u-v)-geodesic. A set X ⊆ V(G) is convex in G if vertices from all (a-b)-geodesics belong to X for any two vertices a,b ∈ X. A set X is a convex dominating set if it is convex and dominating. The convex domination number γ c o n ( G ) of a graph G is the...

Graphs with equal domination and 2-distance domination numbers

Joanna Raczek (2011)

Discussiones Mathematicae Graph Theory

Let G = (V,E) be a graph. The distance between two vertices u and v in a connected graph G is the length of the shortest (u-v) path in G. A set D ⊆ V(G) is a dominating set if every vertex of G is at distance at most 1 from an element of D. The domination number of G is the minimum cardinality of a dominating set of G. A set D ⊆ V(G) is a 2-distance dominating set if every vertex of G is at distance at most 2 from an element of D. The 2-distance domination number of G is the minimum cardinality...

Graphs with small additive stretch number

Dieter Rautenbach (2004)

Discussiones Mathematicae Graph Theory

The additive stretch number s a d d ( G ) of a graph G is the maximum difference of the lengths of a longest induced path and a shortest induced path between two vertices of G that lie in the same component of G.We prove some properties of minimal forbidden configurations for the induced-hereditary classes of graphs G with s a d d ( G ) k for some k ∈ N₀ = 0,1,2,.... Furthermore, we derive characterizations of these classes for k = 1 and k = 2.

Graphs with the same peripheral and center eccentric vertices

Peter Kyš (2000)

Mathematica Bohemica

The eccentricity e ( v ) of a vertex v is the distance from v to a vertex farthest from v , and u is an eccentric vertex for v if its distance from v is d ( u , v ) = e ( v ) . A vertex of maximum eccentricity in a graph G is called peripheral, and the set of all such vertices is the peripherian, denoted P e r i G ) . We use C e p ( G ) to denote the set of eccentric vertices of vertices in C ( G ) . A graph G is called an S-graph if C e p ( G ) = P e r i ( G ) . In this paper we characterize S-graphs with diameters less or equal to four, give some constructions of S-graphs and...

Currently displaying 1 – 13 of 13

Page 1