Results 11 to 20 of about 832,082 (275)
A Model of Directed Graph Cofiber
Axioms, 2022 In the homotopy theory of spaces, the image of a continuous map is contractible to a point in its cofiber. This property does not apply when we discretize spaces and continuous maps to directed graphs and their morphisms.
Zachary McGuirk, Byungdo Park
doaj +1 more source
Mann Iterative Algorithm in Convex Metric Spaces Endowed with a Directed Graph
Journal of Harbin University of Science and Technology, 2021 Compared to the general metric space, the metric space endowed with a directed graph is more complex in space structure, and the directed graph itself does not have a linear structure, and it is relatively difficult to explore the problems of the fixed ...
YANGNi, CHENLili
doaj +1 more source
Simpler and Unified Recognition Algorithm for Path Graphs and Directed Path Graphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceA path graph is the intersection graph of paths in a tree. A directed path graph is the intersection graph of paths in a directed tree. Even if path graphs and directed path graphs are characterized very similarly, their recognition algorithms differ ...
Lorenzo Balzotti
doaj +1 more source
A family of mixed graphs with large order and diameter 2 [PDF]
, 2017 A mixed regular graph is a connected simple graph in which each vertex has both a fixed outdegree (the same indegree) and a fixed undirected degree.
Araujo Pardo, Gabriela +3 more
core +2 more sources
Scalable Graph Convolutional Networks With Fast Localized Spectral Filter for Directed Graphs
IEEE Access, 2020 Graph convolutional neural netwoks (GCNNs) have been emerged to handle graph-structured data in recent years. Most existing GCNNs are either spatial approaches working on neighborhood of each node, or spectral approaches based on graph Laplacian ...
Chensheng Li +4 more
doaj +1 more source
Spektrum Laplace pada graf kincir angin berarah (Q_k^3)
Majalah Ilmiah Matematika dan Statistika, 2022 Suppose that 0 = µ0 ≤ µ1 ≤ ... ≤ µn-1 are eigen values of a Laplacian matrix graph with n vertices and m(µ0), m(µ1), …, m(µn-1) are the multiplicity of each µ, so the Laplacian spectrum of a graph can be expressed as a matrix 2 × n whose line elements ...
Melly Amaliyanah +2 more
doaj +1 more source
Hamiltonicity in Directed Toeplitz Graphs with s1=1 and s3=4
Computational and Mathematical Methods, 2023 A directed Toeplitz graph Tns1,⋯,sk;t1,⋯,tl with vertices 1, 2, ⋯, n is a directed graph whose adjacency matrix is a Toeplitz matrix. In this paper, we investigate the Hamiltonicity in directed Toeplitz graphs Tns1,⋯,sk;t1,⋯,tl with s1=1 and s3=4.
Shabnam Malik
doaj +1 more source
Upward Three-Dimensional Grid Drawings of Graphs [PDF]
, 2005 A \emph{three-dimensional grid drawing} of a graph is a placement of the vertices at distinct points with integer coordinates, such that the straight line segments representing the edges do not cross. Our aim is to produce three-dimensional grid drawings
A. Garg +27 more
core +3 more sources
On total directed graphs of non-commutative rings
AKCE International Journal of Graphs and Combinatorics, 2017 For a non-commutative ring , the left total directed graph of is a directed graph with vertex set as and for the vertices and , is adjacent to if and only if there is a non-zero which is different from and , such that is a left zero-divisor of .
Kukil Kalpa Rajkhowa, Helen K. Saikia
doaj +1 more source
The Structure of a Graph Inverse Semigroup [PDF]
, 2015 Given any directed graph E one can construct a graph inverse semigroup G(E), where, roughly speaking, elements correspond to paths in the graph. In this paper we study the semigroup-theoretic structure of G(E).
Mesyan, Zachary, Mitchell, J. D.
core +3 more sources