Results 1  10
of
927,979
Minus ksubdomination in graphs III
"... Let G = (V, E) be a graph. For any real valued function 1: V+ R and S ~ V, let 1 (S) = L:UES 1 ( u). The weight of 1 is defined as I(V). We will also denote I(N[v]) by I[v] ' where v E V. A minus ksubdominating function (k8F) for G is defined in [1] as a function 1: V+ {I, 0, I} such tha ..."
Abstract
 Add to MetaCart
} such that I[v] 2:: 1 for at least k vertices of G. The minus ksubdomination number of a graph G, denoted by 'Yks 101 (G), is equal to min{I(V) I f is a minus k8F of G}. Hattingh and Ungerer show in [5] that if T is a tree of order n 2:: 2 and k is an integer such that 1:::; k::; n 1, then 'Yk/01(T
Community detection in graphs
, 2009
"... The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices of th ..."
Abstract

Cited by 801 (1 self)
 Add to MetaCart
The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices
Books in graphs
, 2008
"... A set of q triangles sharing a common edge is called a book of size q. We write β (n, m) for the the maximal q such that every graph G (n, m) contains a book of size q. In this note 1) we compute β ( n, cn 2) for infinitely many values of c with 1/4 < c < 1/3, 2) we show that if m ≥ (1/4 − α) ..."
Abstract

Cited by 2380 (22 self)
 Add to MetaCart
A set of q triangles sharing a common edge is called a book of size q. We write β (n, m) for the the maximal q such that every graph G (n, m) contains a book of size q. In this note 1) we compute β ( n, cn 2) for infinitely many values of c with 1/4 < c < 1/3, 2) we show that if m ≥ (1/4 − α
A Framework for Dynamic Graph Drawing
 CONGRESSUS NUMERANTIUM
, 1992
"... Drawing graphs is an important problem that combines flavors of computational geometry and graph theory. Applications can be found in a variety of areas including circuit layout, network management, software engineering, and graphics. The main contributions of this paper can be summarized as follows ..."
Abstract

Cited by 627 (44 self)
 Add to MetaCart
Drawing graphs is an important problem that combines flavors of computational geometry and graph theory. Applications can be found in a variety of areas including circuit layout, network management, software engineering, and graphics. The main contributions of this paper can be summarized
ALGORITHMIC ASPECTS OF TOTAL kSUBDOMINATION IN GRAPHS
"... LetG = (V,E) be a graph and let k ∈ Z+. A total ksubdominating function is a function f:V → {−1, 1} such that for at least k vertices v of G, the sum of the function values of f in the open neighborhood of v is positive. The total ksubdomination number of G is the minimum value of f(V) over all to ..."
Abstract
 Add to MetaCart
LetG = (V,E) be a graph and let k ∈ Z+. A total ksubdominating function is a function f:V → {−1, 1} such that for at least k vertices v of G, the sum of the function values of f in the open neighborhood of v is positive. The total ksubdomination number of G is the minimum value of f(V) over all
Graphbased algorithms for Boolean function manipulation
 IEEE TRANSACTIONS ON COMPUTERS
, 1986
"... In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms. Functions are represented by directed, acyclic graphs in a manner similar to the representations introduced by Lee [1] and Akers [2], but with further restrictions on th ..."
Abstract

Cited by 3499 (47 self)
 Add to MetaCart
on the ordering of decision variables in the graph. Although a function requires, in the worst case, a graph of size exponential in the number of arguments, many of the functions encountered in typical applications have a more reasonable representation. Our algorithms have time complexity proportional
Results 1  10
of
927,979