Results 1  10
of
2,558
Some Adjacent Edge Graceful Graphs
, 2014
"... Let), ( EVG be a graph with p vertices and q edges. A), ( qp graph), ( EVG is said to be an adjacent edge graceful graph if there exists a bijection},.....,3,2,1{)(: qGEf → such that the induced mapping *f from)(GV by i iefuf over all edges ie incident to adjacent vertices of u is an injection. ..."
Abstract
 Add to MetaCart
Let), ( EVG be a graph with p vertices and q edges. A), ( qp graph), ( EVG is said to be an adjacent edge graceful graph if there exists a bijection},.....,3,2,1{)(: qGEf → such that the induced mapping *f from)(GV by i iefuf over all edges ie incident to adjacent vertices of u is an injection
Annals of Adjacent Edge Graceful Graphs
, 2014
"... Abstract. Let), ( EVG be a graph with p vertices and q edges. A), ( qp graph), ( EVG is said to be an adjacent edge graceful graph if there exists a bijection : ()f E G {1, 2,3,.....,}q → such that the induced mapping *f from)(GV by * ()f u ()i i f e= ∑ over all edges ie incident to adjacent verti ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. Let), ( EVG be a graph with p vertices and q edges. A), ( qp graph), ( EVG is said to be an adjacent edge graceful graph if there exists a bijection : ()f E G {1, 2,3,.....,}q → such that the induced mapping *f from)(GV by * ()f u ()i i f e= ∑ over all edges ie incident to adjacent
PLASTIC DESIGN OF REGULAR ORTHOTROPIC GRIDS WITH TWO ADJACENT EDGES FIXED,
"... Lowerbound solutions to the problem of collapse of regular rectangular, orthotropic grids with two adjacent edges clamped and the other two either free or simply supported and carrying a uniform concentration of normal nodal forces are developed. The virtualwork method of plastic analysis is used ..."
Abstract
 Add to MetaCart
Lowerbound solutions to the problem of collapse of regular rectangular, orthotropic grids with two adjacent edges clamped and the other two either free or simply supported and carrying a uniform concentration of normal nodal forces are developed. The virtualwork method of plastic analysis is used
Hierarchical edge bundles: Visualization of adjacency relations in hierarchical data
 IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS
, 2006
"... A compound graph is a frequently encountered type of data set. Relations are given between items, and a hierarchy is defined on the items as well. We present a new method for visualizing such compound graphs. Our approach is based on visually bundling the adjacency edges, i.e., nonhierarchical edge ..."
Abstract

Cited by 271 (12 self)
 Add to MetaCart
A compound graph is a frequently encountered type of data set. Relations are given between items, and a hierarchy is defined on the items as well. We present a new method for visualizing such compound graphs. Our approach is based on visually bundling the adjacency edges, i.e., non
A distributed algorithm for minimumweight spanning trees
, 1983
"... A distributed algorithm is presented that constructs he minimumweight spanning tree in a connected undirected graph with distinct edge weights. A processor exists at each node of the graph, knowing initially only the weights of the adjacent edges. The processors obey the same algorithm and exchange ..."
Abstract

Cited by 435 (3 self)
 Add to MetaCart
A distributed algorithm is presented that constructs he minimumweight spanning tree in a connected undirected graph with distinct edge weights. A processor exists at each node of the graph, knowing initially only the weights of the adjacent edges. The processors obey the same algorithm
An optimal graph theoretic approach to data clustering: Theory and its application to image segmentation
 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 1993
"... A novel graph theoretic approach for data clustering is presented and its application to the image segmentation problem is demonstrated. The data to be clustered are represented by an undirected adjacency graph G with arc capacities assigned to reflect the similarity between the linked vertices. Cl ..."
Abstract

Cited by 360 (0 self)
 Add to MetaCart
A novel graph theoretic approach for data clustering is presented and its application to the image segmentation problem is demonstrated. The data to be clustered are represented by an undirected adjacency graph G with arc capacities assigned to reflect the similarity between the linked vertices
Centertrack: An IP overlay network for tracking DoS floods
 In Proceedings of USENIX Security Symposium’2000
, 2000
"... Finding the source of forged Internet Protocol (IP) datagrams in a large, highspeed network is difficult due to the design of the IP protocol and the lack of sufficient capability in most highspeed, highcapacity router implementations. Typically, not enough of the routers in such a network are cap ..."
Abstract

Cited by 254 (0 self)
 Add to MetaCart
, that is used to selectively reroute interesting datagrams directly from edge routers to special tracking routers. The tracking routers, or associated sniffers, can easily determine the ingress edge router by observing from which tunnel the datagrams arrive. The datagrams can be examined, then dropped
Adjacent vertex distinguishing edgecolorings
, 2002
"... An adjacent vertex distinguishing edgecoloring of a simple graph G is a proper edgecoloring of G such that no pair of adjacent vertices meets the same set of colors. The minimum number of colors Ïâ²a(G) required to give G an adjacent vertex distinguishing coloring is studied for graphs with no i ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
An adjacent vertex distinguishing edgecoloring of a simple graph G is a proper edgecoloring of G such that no pair of adjacent vertices meets the same set of colors. The minimum number of colors Ïâ²a(G) required to give G an adjacent vertex distinguishing coloring is studied for graphs
On the Origins of Power Laws in Internet Topologies
 39th Annual Allerton Conference on Communication, Control, and Computing, 2001 www.merit.edu/~mrt
"... Recent empirical studies [6] have shown that Internet topologies exhibit power laws of the form � for the following relationships: (P1) outdegree of node (domain or router) versus rank; (P2) number of nodes versus outdegree; (P3) number of node pairs within a neighborhood versus neighborhood size (i ..."
Abstract

Cited by 220 (4 self)
 Add to MetaCart
(in hops); and (P4) eigenvalues of the adjacency matrix versus rank. However, causes for the appearance of such power laws have not been convincingly given. In this paper, we examine four factors in the formation of Internet topologies. These factors are (F1) preferential connectivity of a new node
ON THE EDGE COLORING OF GRAPH PRODUCTS
, 2004
"... The edge chromatic number of G is the minimum number of colors required to color the edges of G in such a way that no two adjacent edges have the same color. We will determine a sufficient condition for a various graph products to be of class 1, namely, strong product, semistrong product, and specia ..."
Abstract
 Add to MetaCart
The edge chromatic number of G is the minimum number of colors required to color the edges of G in such a way that no two adjacent edges have the same color. We will determine a sufficient condition for a various graph products to be of class 1, namely, strong product, semistrong product
Results 1  10
of
2,558