CDS in General Graph

2012 ◽  
pp. 11-34
Author(s):  
Ding-Zhu Du ◽  
Peng-Jun Wan
Keyword(s):  
General Graph

scholarly journals Core–periphery models for graphs based on their δ-hyperbolicity: An example using biological networks

2016 ◽  
Vol 11 (1) ◽  
pp. 40-57 ◽  
Author(s):  
Hend Alrasheed ◽  
Feodor F Dragan
Keyword(s):  
Biological Networks ◽  
Extended Version ◽  
Conference Paper ◽  
General Graph ◽  
The Core ◽  
Bending Property ◽  
Minimum Cover ◽  
New Perspective ◽  
Graph Form ◽  
Peak Model

Hyperbolicity is a global property of graphs that measures how close their structures are to trees in terms of their distances. It embeds multiple properties that facilitate solving several problems that found to be hard in the general graph form. In this paper, we investigate the hyperbolicity of graphs not only by considering Gromov’s notion of δ-hyperbolicity but also by analyzing its relationship to other graph’s parameters. This new perspective allows us to classify graphs with respect to their hyperbolicity and to show that many biological networks are hyperbolic. Then we introduce the eccentricity-based bending property which we exploit to identify the core vertices of a graph by proposing two models: the maximum-peak model and the minimum cover set model. In this extended version of the paper, we include some new theorems, as well as proofs of the theorems proposed in the conference paper. Also, we present the algorithms we used for each of the proposed core identification models, and we provide more analysis, explanations, and examples.

Autonomous Unmanned Aerial Vehicle for Post-Disaster Management With Cognitive Radio Communication

2021 ◽  
Vol 12 (1) ◽  
pp. 29-52
Author(s):  
Raja Guru R. ◽  
Naresh Kumar P.
Keyword(s):  
Unmanned Aerial Vehicles ◽  
Processing Technique ◽  
High Accuracy ◽  
Image Processing Technique ◽  
Radio Communication ◽  
Dynamic Changes ◽  
General Graph ◽  
Vision Based Navigation ◽  
Aerial Vehicle ◽  
Post Disaster

Unmanned aerial vehicles (UAV) play a significant role in finding victims affected in the post-disaster zone, where a man cannot risk his life under a critical condition of the disaster environment. The proposed design incorporates autonomous vision-based navigation through the disaster environment based on general graph theory with dynamic changes on the length between two or multiple nodes, where a node is a pathway. Camera fixed on it continuously captures the surrounding footage, processing it frame by frame on-site using image processing technique based on a SOC. Identifies victims in the zone and the pathways available for traversal. UAV uses an ultrasonic rangefinder to avoid collision with obstacles. The system alerts the rescue team if any victim detected and transmits the frames using CRN to the off-site console. UAV learns navigation policy that achieves high accuracy in real-time environments; communication using CRN is uninterrupted and useful during such emergencies.

scholarly journals Compact and efficient representation of general graph databases

2018 ◽  
Vol 60 (3) ◽  
pp. 1479-1510 ◽  
Author(s):  
Sandra Álvarez-García ◽  
Borja Freire ◽  
Susana Ladra ◽  
Óscar Pedreira
Keyword(s):  
Graph Databases ◽  
General Graph ◽  
Efficient Representation

Graph-Based Induction for General Graph Structured Data

1999 ◽  
pp. 340-342 ◽  
Author(s):  
Takashi Matsuda ◽  
Tadashi Horiuchi ◽  
Hiroshi Motoda ◽  
Takashi Washio ◽  
Kohei Kumazawa ◽  
...  
Keyword(s):  
Structured Data ◽  
General Graph

Proper Coloring Distance in Edge-Colored Cartesian Products of Complete Graphs and Cycles

2019 ◽  
Vol 29 (04) ◽  
pp. 1950016
Author(s):  
Ajay Arora ◽  
Eddie Cheng ◽  
Colton Magnant
Keyword(s):  
Connected Graph ◽  
The Other ◽  
Complete Graphs ◽  
Specific Class ◽  
Proper Coloring ◽  
Cartesian Products ◽  
General Graph ◽  
Proper Distance ◽  
Cyclic Graphs

An path that is edge-colored is called proper if no two consecutive edges receive the same color. A general graph that is edge-colored is called properly connected if, for every pair of vertices in the graph, there exists a properly colored path from one to the other. Given two vertices u and v in a properly connected graph G, the proper distance is the length of the shortest properly colored path from u to v. By considering a specific class of colorings that are properly connected for Cartesian products of complete and cyclic graphs, we present results on the proper distance between all pairs of vertices in the graph.

scholarly journals Critical sets for Sudoku and general graph colorings

2014 ◽  
Vol 315-316 ◽  
pp. 112-119 ◽  
Author(s):  
Joshua Cooper ◽  
Anna Kirkpatrick
Keyword(s):  
Graph Colorings ◽  
General Graph ◽  
Critical Sets

(1, 2)-Factorizations of General Eulerian Nearly Regular Graphs

1994 ◽  
Vol 3 (1) ◽  
pp. 87-95 ◽  
Author(s):  
Roland Häggkvist ◽  
Anders Johansson
Keyword(s):  
Regular Graphs ◽  
General Graph ◽  
Edge Colouring

Every general graph with degrees 2k and 2k − 2, k ≥ 3, with zero or at least two vertices of degree 2k − 2 in each component, has a k-edge-colouring such that each monochromatic subgraph has degree 1 or 2 at every vertex.In particular, if T is a triangle in a 6-regular general graph, there exists a 2-factorization of G such that each factor uses an edge in T if and only if T is non-separating.

Sign in / Sign up

Export Citation Format

Share Document