Duality theorems for regular homotopy of finite directed graphs

1982 ◽  
Vol 31 (3) ◽  
pp. 371-400 ◽  
Author(s):  
Marco Burzio ◽  
Davide Carlo Demaria
Keyword(s):  
Directed Graphs ◽  
Duality Theorems ◽  
Finite Directed Graphs ◽  
Regular Homotopy

A Ring Construction Using Finite Directed Graphs

PRIMUS ◽  
2012 ◽  
Vol 22 (5) ◽  
pp. 428-436 ◽  
Author(s):  
Michael Bardzell
Keyword(s):  
Directed Graphs ◽  
Finite Directed Graphs

scholarly journals Metrics Based on Finite Directed Graphs and Coding Invariants

2018 ◽  
Vol 64 (4) ◽  
pp. 2398-2409 ◽  
Author(s):  
Tuvi Etzion ◽  
Marcelo Firer ◽  
Roberto Assis Machado
Keyword(s):  
Directed Graphs ◽  
Finite Directed Graphs

scholarly journals Sharp Inequalities for the Hardy–Littlewood Maximal Operator on Finite Directed Graphs

Mathematics ◽  
2021 ◽  
Vol 9 (9) ◽  
pp. 946
Author(s):  
Xiao Zhang ◽  
Feng Liu ◽  
Huiyun Zhang
Keyword(s):  
Directed Graph ◽  
Maximal Operator ◽  
Directed Graphs ◽  
Optimal Constants ◽  
Finite Directed Graphs ◽  
Littlewood Maximal Operator

In this paper, we introduce and study the Hardy–Littlewood maximal operator MG→ on a finite directed graph G→. We obtain some optimal constants for the ℓp norm of MG→ by introducing two classes of directed graphs.

Graph Pattern Matching: Capturing Bisimilar Subgraph

2020 ◽  
pp. 2150011
Author(s):  
Rui Qiao ◽  
Ke Feng ◽  
Heng He ◽  
Xiaolei Zhong
Keyword(s):  
Pattern Matching ◽  
Graph Matching ◽  
Directed Graphs ◽  
Graph Databases ◽  
Graph Pattern Matching ◽  
Query Graph ◽  
Graph Pattern ◽  
Finite Directed Graphs ◽  
Data Graph ◽  
Text Language

Graph pattern matching that aims to seek out answer graphs in a data graph matching a provided graph, plays a fundamental role as a part of graph search for graph databases. “Matching” indicates that the two graphs are correlated, such as bisimulation, isomorphism, simulation, etc. The strictness of bisimulation is between simulation and isomorphism. Seldom work has been done to search for bisimulation subgraphs. This research focuses on the problem. The symbol [Formula: see text] is introduced to fundamental modal logic language, thereby yielding [Formula: see text] language; the symbols [Formula: see text] is added for forming [Formula: see text] formulas. Then conclusions about graph bisimulations are shown. Subsequently, a theorem with detailed proof is presented, stating that [Formula: see text] formulas characterize finite directed graphs modulo bisimulation. According to the conclusions and theorem, algorithms for finding subgraphs are proposed. After dividing the query graph, the match graphs undergo the characterization using [Formula: see text] formulas. In the data graphs, by model checking the formulas, the answer graphs exhibiting bisimilarity to the match graphs are able to be captured.

Sign in / Sign up

Export Citation Format

Share Document