Results 1  10
of
241
MAXIMAL VERTEXCONNECTIVITY OF −−→ Sn,k
"... Abstract. The class of star graphs is a popular topology for interconnection networks. However it has certain deficiencies. A class of generalization of star graphs called (n, k)star graphs was introduced in [12] to address these issues. In this paper we will consider the vertexconnectivity of the ..."
Abstract
 Add to MetaCart
Abstract. The class of star graphs is a popular topology for interconnection networks. However it has certain deficiencies. A class of generalization of star graphs called (n, k)star graphs was introduced in [12] to address these issues. In this paper we will consider the vertexconnectivity
Unicyclic graphs with maximal energy
 LINEAR ALGEBRA AND ITS APPLICATIONS 356 (2002) 27–36
, 2002
"... Let G be a graph on n vertices and let λ1, λ2,..., λn be its eigenvalues. The energy of G is defined as E(G) = λ1  + λ2  + · · · + λn. For various classes of unicyclic graphs, the graphs with maximal energy are determined. Let P 6n be obtained by connecting a vertex of the circuit C6 with a ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
Let G be a graph on n vertices and let λ1, λ2,..., λn be its eigenvalues. The energy of G is defined as E(G) = λ1  + λ2  + · · · + λn. For various classes of unicyclic graphs, the graphs with maximal energy are determined. Let P 6n be obtained by connecting a vertex of the circuit C6
Finding multiple maximally redundant trees in linear time
"... Redundant trees are directed spanning trees, which provide disjoint paths towards their roots. Therefore, this concept is widely applied in the literature both for providing protection and load sharing. The fastest algorithm can find multiple redundant trees, a pair of them rooted at each vertex, in ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
, in linear time. Unfortunately, edge or vertexredundant trees can only be found in 2edge or 2vertexconnected graphs respectively. Therefore, the concept of maximally redundant trees was introduced, which can overcome this problem, and provides maximally disjoint paths towards the common root
Monitor Placement for Maximal Identifiability in Network Tomography
"... We investigate the problem of placing a given number of monitors in a communication network to identify the maximum number of link metrics from endtoend measurements between monitors, assuming that link metrics are additive, and measurement paths cannot contain cycles. Motivated by our previous r ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
on this algorithm, we develop a polynomialtime greedy algorithm to incrementally place monitors such that each newly placed monitor maximizes the number of additional identifiable links. We prove that the proposed algorithm is optimal for 2vertexconnected networks, and demonstrate that it is near
On the maximal number of disjoint circuits of a graph
, 1962
"... Throughout this paper Gg " will denote a graph with n vertices and k edges where circuits consisting of two edges and loops (i. e. circuits of one edge) are not permitted and G' " will denote a graph of n vertices and k edges where loops and circuits with two edges are permitted. v(G) ..."
Abstract

Cited by 43 (0 self)
 Add to MetaCart
of G spanned by the vertices x,,..., xk. The valency of a vertex x v (x) will denote the number of edges incident to it. (A loop is counted doubly.) The edge connecting x, and x, will be denoted by [x,, x,], edges will sometimes be denoted by e,, ez,.... (x,, x,,...xk) will denote the circuit having
Abstract. We prove that the maximal number of directed edges in
, 1999
"... vertexcritical strongly connected simple digraph on n vertices is ( n 2 n + 4. ..."
Abstract
 Add to MetaCart
vertexcritical strongly connected simple digraph on n vertices is ( n 2 n + 4.
Maximally local connectivity and connected components . . .
, 2012
"... ... important factors in evaluating the reliability and fault tolerance of a network. It is known twork topologies the term connectivit corresponding graph. Connectivity is one of the important factors for evaluating the fault tolerance of a network [3,4,1 connectivity of G, written jðGÞ, is defined ..."
Abstract
 Add to MetaCart
... important factors in evaluating the reliability and fault tolerance of a network. It is known twork topologies the term connectivit corresponding graph. Connectivity is one of the important factors for evaluating the fault tolerance of a network [3,4,1 connectivity of G, written jðGÞ,
Profitmaximizing pricing for tollbooths
"... The input to the tollbooth problem is a graph G = (V, E) and a set of m buyers Pi where each buyer is interested in buying a path Pi connecting si, ti ∈ V. Each buyer comes with a budget b(Pi), a positive real number. The problem is to set nonnegative prices to the edges E of G. A buyer buys her p ..."
Abstract
 Add to MetaCart
The input to the tollbooth problem is a graph G = (V, E) and a set of m buyers Pi where each buyer is interested in buying a path Pi connecting si, ti ∈ V. Each buyer comes with a budget b(Pi), a positive real number. The problem is to set nonnegative prices to the edges E of G. A buyer buys her
ON MAXIMALLY INFLECTED HYPERBOLIC CURVES
"... Abstract. In this note we study the distribution of real inflection points among the ovals of a real nonsingular hyperbolic curve of even degree. Using Hilbert’s method we show that for any integers d and r such that 4 ≤ r ≤ 2d2 − 2d, there is a nonsingular hyperbolic curve of degree 2d in R2 with ..."
Abstract
 Add to MetaCart
with exactly r line segments in the boundary of its convex hull. We also give a complete classification of possible distributions of inflection points among the ovals of a maximally inflected nonsingular hyperbolic curve of degree 6. 1.
IJMC The Maximal Total Irregularity of Some Connected Graphs
"... ABSTRACT The total irregularity of a simple graph is defined as , where denotes the degree of a vertex ∈ ( ). In this paper by using the Gini index, we obtain the ordering of the total irregularity index for some classes of connected graphs, with the same number of vertices. ..."
Abstract
 Add to MetaCart
ABSTRACT The total irregularity of a simple graph is defined as , where denotes the degree of a vertex ∈ ( ). In this paper by using the Gini index, we obtain the ordering of the total irregularity index for some classes of connected graphs, with the same number of vertices.
Results 1  10
of
241