Definitions from Graph Theory and Graph Products

2020 ◽  
pp. 1-10
Author(s):  
Ali Kaveh ◽  
Hossein Rahami ◽  
Iman Shojaei
Keyword(s):  
Graph Theory ◽  
Graph Products

scholarly journals Efficient open domination in graph products

2014 ◽  
Vol Vol. 16 no. 1 (Graph Theory) ◽  
Author(s):  
Dorota Kuziak ◽  
Iztok Peterin ◽  
Ismael Gonzalez Yero
Keyword(s):  
Graph Theory ◽  
Cartesian Product ◽  
Graph Products ◽  
International Audience ◽  
Domination Graphs

Graph Theory International audience A graph G is an efficient open domination graph if there exists a subset D of V(G) for which the open neighborhoods centered in vertices of D form a partition of V(G). We completely describe efficient open domination graphs among lexicographic, strong, and disjunctive products of graphs. For the Cartesian product we give a characterization when one factor is K2.

The graph structure of graph groups that are subgroups of Thompson’s group V

2016 ◽  
Vol 26 (08) ◽  
pp. 1497-1501 ◽  
Author(s):  
Nathan Corwin ◽  
Kathryn Haymaker
Keyword(s):  
Graph Theory ◽  
Graph Structure ◽  
Graph Products ◽  
Induced Subgraph ◽  
Group V ◽  
Simple Graphs ◽  
Theory Result ◽  
Thompson’S Group ◽  
Right Angled Artin Groups ◽  
Graph Groups

We determine exactly which graph products, also known as Right Angled Artin Groups, embed into Richard Thompson’s group [Formula: see text]. It was shown by Bleak and Salazar-Díaz that [Formula: see text] was an obstruction. We show that this is the only obstruction. This is shown by proving a graph theory result giving an alternate description of simple graphs without an appropriate induced subgraph.

Graph Theory, Coding Theory and Block Designs

1975 ◽  
Author(s):  
P. J. Cameron ◽  
J. H. van Lint
Keyword(s):  
Graph Theory ◽  
Coding Theory ◽  
Block Designs

APL and graph theory in dynamic systems analysis

1981 ◽  
Vol 128 (3) ◽  
pp. 85 ◽  
Author(s):  
C. Schizas ◽  
F.J. Evans
Keyword(s):  
Graph Theory ◽  
Dynamic Systems ◽  
Systems Analysis

Pattern Recognition in Histo-Pathology: Basic Considerations

1982 ◽  
Vol 21 (01) ◽  
pp. 15-22 ◽  
Author(s):  
W. Schlegel ◽  
K. Kayser
Keyword(s):  
Pattern Recognition ◽  
Graph Theory ◽  
Normal Tissue ◽  
Diagnostic Procedures ◽  
Minimal Distance ◽  
Malignant Growth ◽  
Colon Tissue ◽  
First Results ◽  
Tissue Structures ◽  
The Given

A basic concept for the automatic diagnosis of histo-pathological specimen is presented. The algorithm is based on tissue structures of the original organ. Low power magnification was used to inspect the specimens. The form of the given tissue structures, e. g. diameter, distance, shape factor and number of neighbours, is measured. Graph theory is applied by using the center of structures as vertices and the shortest connection of neighbours as edges. The algorithm leads to two independent sets of parameters which can be used for diagnostic procedures. First results with colon tissue show significant differences between normal tissue, benign and malignant growth. Polyps form glands that are twice as wide as normal and carcinomatous tissue. Carcinomas can be separated by the minimal distance of the glands formed. First results of pattern recognition using graph theory are discussed.

Application of Graph Theory in Social Media

2018 ◽  
Vol 6 (10) ◽  
pp. 722-729 ◽  
Author(s):  
Anwesha Chakraborty ◽  
Trina Dutta ◽  
Sushmita Mondal ◽  
Asoke Nath
Keyword(s):  
Social Media ◽  
Graph Theory
Sign in / Sign up

Export Citation Format

Share Document