Results 1  10
of
9,735
Double Vertex Graphs and Complete Double Vertex Graphs
, 2007
"... Let G = (V, E) be a graph of order n ≥ 2. The double vertex graph, U2(G), is the graph whose vertex set consists of all � � n un2 ordered pairs from V such that two vertices {x, y} and {u, v} are adjacent if and only if {x, y} � {u, v}  = 1 and if x = u, then y and v are adjacent in G. A gener ..."
Abstract
 Add to MetaCart
Let G = (V, E) be a graph of order n ≥ 2. The double vertex graph, U2(G), is the graph whose vertex set consists of all � � n un2 ordered pairs from V such that two vertices {x, y} and {u, v} are adjacent if and only if {x, y} � {u, v}  = 1 and if x = u, then y and v are adjacent in G. A
OneMother Vertex Graphs
"... Abstract: In this paper we will define a new type of graph. The idea of this definition is based on when we illustrate the cardiovascular system by a graph we find that not all vertices have the same important so we define this new graph and call it 1 mother vertex graph. ..."
Abstract
 Add to MetaCart
Abstract: In this paper we will define a new type of graph. The idea of this definition is based on when we illustrate the cardiovascular system by a graph we find that not all vertices have the same important so we define this new graph and call it 1 mother vertex graph.
Total Block Edge Cut Vertex Graph
, 2012
"... In this paper, we introduce the concept of the total block edge cut vertex graph. We obtain some properties of these graphs. We present characterization of graphs whose total block edge cut vertex graphs planar, outer planar, minimally non outer planar and crossing number one. ..."
Abstract
 Add to MetaCart
In this paper, we introduce the concept of the total block edge cut vertex graph. We obtain some properties of these graphs. We present characterization of graphs whose total block edge cut vertex graphs planar, outer planar, minimally non outer planar and crossing number one.
Hyperspherical integration and the triplecross vertex graphs
, 1994
"... We have extended the hyperspherical variables method to the analytical calculation of the angular integral of the box graph. We discuss the applications of our results to the analytical calculation of the QED contribution to the electron g2 of the set of threeloop triplecross vertex graphs. ..."
Abstract
 Add to MetaCart
We have extended the hyperspherical variables method to the analytical calculation of the angular integral of the box graph. We discuss the applications of our results to the analytical calculation of the QED contribution to the electron g2 of the set of threeloop triplecross vertex graphs.
A Note on the Inducibility of 4Vertex Graphs
 GRAPHS AND COMBINATORICS
, 2014
"... There is much recent interest in understanding the density at which constant size graphs can appear in a very large graph. Specifically, the inducibility of a graph H is its extremal density, as an induced subgraph of G, where G  → ∞. Already for 4vertex graphs many questions are still open. Th ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
There is much recent interest in understanding the density at which constant size graphs can appear in a very large graph. Specifically, the inducibility of a graph H is its extremal density, as an induced subgraph of G, where G  → ∞. Already for 4vertex graphs many questions are still open
Algebraic Graph Theory
, 2011
"... Algebraic graph theory comprises both the study of algebraic objects arising in connection with graphs, for example, automorphism groups of graphs along with the use of algebraic tools to establish interesting properties of combinatorial objects. One of the oldest themes in the area is the investiga ..."
Abstract

Cited by 892 (13 self)
 Add to MetaCart
is the investigation of the relation between properties of a graph and the spectrum of its adjacency matrix. A central topic and important source of tools is the theory of association schemes. An association scheme is, roughly speaking, a collection of graphs on a common vertex set which fit together in a highly
Automatic image analysis of histopathology specimens using concave vertex graph.
 In: International Conference on Medical Image Computing and Computer Assisted Intervention,
, 2008
"... Abstract. Automatic image analysis of histopathology specimens would help the early detection of blood cancer. The first step for automatic image analysis is segmentation. However, touching cells bring the difficulty for traditional segmentation algorithms. In this paper, we propose a novel algorit ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
algorithm which can reliably handle touching cells segmentation. Robust estimation and color active contour models are used to delineate the outer boundary. Concave points on the boundary and inner edges are automatically detected. A concave vertex graph is constructed from these points and edges
Pregel: A system for largescale graph processing
 IN SIGMOD
, 2010
"... Many practical computing problems concern large graphs. Standard examples include the Web graph and various social networks. The scale of these graphs—in some cases billions of vertices, trillions of edges—poses challenges to their efficient processing. In this paper we present a computational model ..."
Abstract

Cited by 496 (0 self)
 Add to MetaCart
model suitable for this task. Programs are expressed as a sequence of iterations, in each of which a vertex can receive messages sent in the previous iteration, send messages to other vertices, and modify its own state and that of its outgoing edges or mutate graph topology. This vertexcentric approach
Results 1  10
of
9,735