Results 1 to 10 of about 16,428 (161)
On the spectral radius and energy of signless Laplacian matrix of digraphs [PDF]
Heliyon, 2022 Let D be a digraph of order n and with a arcs. The signless Laplacian matrix Q(D) of D is defined as Q(D)=Deg(D)+A(D), where A(D) is the adjacency matrix and Deg(D) is the diagonal matrix of vertex out-degrees of D.
Hilal A Ganie, YILUN Shang
exaly +3 more sources
Spectral norm and energy of a digraph with respect to a VDB topological index [PDF]
HeliyonThe set of singular values of a digraph with respect to a vertex-degree based topological index is the set of all singular values of its general adjacency matrix.
Carlos Espinal, Juan Monsalve, Juan Rada
doaj +2 more sources
Sombor index of directed graphs [PDF]
Heliyon, 2022 Let D be a digraph with set of arcs A. The Sombor index of D is defined asSO(D)=12∑uv∈A(du+)2+(dv−)2,where du+ and dv− are the out-degree and in-degree of the vertices u and v of D.
Roberto Cruz, Juan Monsalve, Juan Rada
doaj +2 more sources
On the path homology of Cayley digraphs and covering digraphs [PDF]
Journal of Algebra, 2023 We develop a theory of covering digraphs, similar to the theory of covering spaces. By applying this theory to Cayley digraphs, we build a"bridge"between GLMY-theory and group homology theory, which helps to reduce path homology calculations to group ...
Shaobo Di +3 more
semanticscholar +1 more source
The double competition multigraph of a digraph [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 In this article, we introduce the notion of the double competition multigraph of a digraph. We give characterizations of the double competition multigraphs of arbitrary digraphs, loopless digraphs, reflexive digraphs, and acyclic digraphs in terms of ...
Yoshio Sano, Jeongmi Park
doaj +1 more source
Dual digraphs of finite semidistributive lattices
Cubo, 2022 Dual digraphs of finite join-semidistributive lattices, meet-semidistributive lattices and semidistributive lattices are characterised. The vertices of the dual digraphs are maximal disjoint filter-ideal pairs of the lattice.
Andrew Craig +2 more
doaj +1 more source
On BMRN*-colouring of planar digraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 In a recent work, Bensmail, Blanc, Cohen, Havet and Rocha, motivated by applications for TDMA scheduling problems, have introduced the notion of BMRN*-colouring of digraphs, which is a type of arc-colouring with particular colouring constraints.
Julien Bensmail, Foivos Fioravantes
doaj +1 more source
Entropy based Single Valued Neutrosophic Digraph and its applications [PDF]
Neutrosophic Sets and Systems, 2018 This paper introduces the single valued neutrosophic (i.e. SVN) digraph. The basic terminologies and operations of SVN digraphs have been defined. Later certain types of SVN digraphs are shown and some of the important properties of SVN digraphs are ...
Kalyan Sinha, Pinaki Majumdar
doaj +1 more source
Extension of Gyarfas-Sumner conjecture to digraphs [PDF]
Electronic Journal of Combinatorics, 2020 The dichromatic number of a digraph $D$ is the minimum number of colors needed to color its vertices in such a way that each color class induces an acyclic digraph.
Pierre Aboulker +2 more
semanticscholar +1 more source