Results 1 to 10 of about 86,012 (266)
Extending Undirected Graph Techniques to Directed Graphs via Category Theory
We use Category Theory to construct a ‘bridge’ relating directed graphs with undirected graphs, such that the notion of direction is preserved. Specifically, we provide an isomorphism between the category of simple directed graphs and a category we call ‘
Sebastian Pardo-Guerra +4 more
doaj +3 more sources
A New Metaphor-Free Metaheuristic Approach Based on Complex Networks and Bezier Curves
A metaheuristic method is an optimization technique that is generally inspired by natural or physical processes. The use of metaphors has created a tendency to reproduce existing algorithms with slight modifications or variations rather than encouraging ...
Karla Avila +3 more
doaj +1 more source
Solutions of Detour Distance Graph Equations
Graph theory is a useful mathematical structure used to model pairwise relations between sensor nodes in wireless sensor networks. Graph equations are nothing but equations in which the unknown factors are graphs.
S. Celine Prabha +7 more
doaj +1 more source
Roughness in Fuzzy Cayley Graphs
Rough set theory is a worth noticing approach for inexact and uncertain system modelling. When rough set theory accompanies with fuzzy set theory, which both are a complementary generalization of set theory, they will be attended by potency in ...
M.H. Shahzamanian, B. Davvaz
doaj +1 more source
Quotient Energy of Zero Divisor Graphs And Identity Graphs
Consider the (p,q) simple connected graph . The sum absolute values of the spectrum of quotient matrix of a graph make up the graph's quotient energy.
M. Lalitha Kumari +2 more
doaj +1 more source
Brief survey on divisor graphs and divisor function graphs
Number theoretic graphs are one of the emerging fields in Graph theory. This article is a study on existing research results on Number theoretic graphs, especially on Divisor Graphs [Formula: see text], Divisor Function Graphs (DFGs) and Divisor Cayley ...
Vignesh Ravi, Kalyani Desikan
doaj +1 more source
Approximations of Acyclic Graphs
In this paper, approximations of acyclic graphs are studied. It is proved that any theory of an acyclic graph (tree) of finite diameter is pseudofinite with respect to acyclic graphs (trees), that is, any such theory is approximated by theories of finite
N.D. Markhabatov
doaj +1 more source
Recent developments on the power graph of finite groups – a survey
Algebraic graph theory is the study of the interplay between algebraic structures (both abstract as well as linear structures) and graph theory. Many concepts of abstract algebra have facilitated through the construction of graphs which are used as tools
Ajay Kumar +3 more
doaj +1 more source
On the Quasi-Total Roman Domination Number of Graphs
Domination theory is a well-established topic in graph theory, as well as one of the most active research areas. Interest in this area is partly explained by its diversity of applications to real-world problems, such as facility location problems ...
Abel Cabrera Martínez +2 more
doaj +1 more source
Confluence theory for graphs [PDF]
We develop a theory of confluence of graphs. We describe an algorithm for proving that a given system of reduction rules for abstract graphs and graphs in surfaces is locally confluent. We apply this algorithm to show that each simple Lie algebra of rank at most 2, gives rise to a confluent system of reduction rules of graphs (via Kuperberg's spiders ...
Sikora, Adam, Westbury, Bruce
openaire +3 more sources

