Results 1 to 10 of about 139,520 (142)

Sombor index of directed graphs [PDF]

open access: yesHeliyon, 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

Line graphs of directed graphs I [PDF]

open access: yesTransactions on Combinatorics
We determine the forbidden induced subgraphs for the intersection of the classes of chordal bipartite graphs and line graphs of acyclic directed graphs. This is a first step towards finding the forbidden induced subgraphs for the class of line graphs of ...
Vaidyanathan Sivaraman, Daniel Slilaty
doaj   +4 more sources

Chained structure of directed graphs with applications to social and transportation networks [PDF]

open access: yesApplied Network Science, 2022
The need to determine the structure of a graph arises in many applications. This paper studies directed graphs and defines the notions of $$\ell$$ ℓ -chained and $$\{\ell ,k\}$$ { ℓ , k } -chained directed graphs.
Anna Concas   +4 more
doaj   +2 more sources

Some novel concepts of intuitionistic fuzzy directed graphs with application in selecting a suitable place for opening restaurant [PDF]

open access: yesHeliyon
In this manuscript, we first initiate several types of effective arcs of intuitionistic fuzzy directed graphs, followed by discussions on different types of dominations in intuitionistic fuzzy directed graphs and their application in decision-making. The
Waheed Ahmad Khan   +7 more
doaj   +2 more sources

Fixation times on directed graphs. [PDF]

open access: yesPLoS Computational Biology
Computing the rate of evolution in spatially structured populations is difficult. A key quantity is the fixation time of a single mutant with relative reproduction rate r which invades a population of residents. We say that the fixation time is "fast" if
David A Brewster   +2 more
doaj   +2 more sources

On the domination number of $t$-constrained de Bruijn graphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2022
Motivated by the work on the domination number of directed de Bruijn graphs and some of its generalizations, in this paper we introduce a natural generalization of de Bruijn graphs (directed and undirected), namely $t$-constrained de Bruijn graphs, where
Tiziana Calamoneri   +2 more
doaj   +1 more source

Domination in Fuzzy Directed Graphs

open access: yesMathematics, 2021
A new domination parameter in a fuzzy digraph is proposed to espouse a contribution in the domain of domination in a fuzzy graph and a directed graph. Let GD*=V,A be a directed simple graph, where V is a finite nonempty set and A=x,y:x,y∈V,x≠y.
Enrico Enriquez   +4 more
doaj   +1 more source

A Study on Semi-directed Graphs for Social Media Networks

open access: yesInternational Journal of Computational Intelligence Systems, 2021
In the literature of graph theory, networks are represented as directed graphs or undirected graphs and a mixed of both combinations. In today's era of computing, networks like brain and facebook that do not belong to any of the mentioned networks ...
Sovan Samanta   +4 more
doaj   +1 more source

Hermitian Laplacian Matrix of Directed Graphs [PDF]

open access: yesJisuanji kexue, 2023
Laplacian matrix plays an important role in the research of undirected graphs.From its spectrum,some structure and properties of a graph can be deduced.Based on this,several efficient algorithms have been designed for relevant tasks in graphs,such as ...
LIU Kaiwen, HUANG Zengfeng
doaj   +1 more source

Coordination Games on Directed Graphs [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2016
We study natural strategic games on directed graphs, which capture the idea of coordination in the absence of globally common strategies. We show that these games do not need to have a pure Nash equilibrium and that the problem of determining their ...
Krzysztof R. Apt   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy