Results 61 to 70 of about 8,914 (221)
Embedding b-Metric Spaces of Reducible Fuzzy Digraphs into Normed Spaces
Journal of Applied Science and EngineeringIn traditional and iterative algebraic techniques, representing fuzzy digraphs using their adjacency matrices can pose challenges, particularly when dealing with graphs featuring an extensive quantity of nodes or edges.
Umilkeram Qasim Obaid
doaj +1 more source
Extremal skew energy of digraphs with no even cycles [PDF]
Transactions on Combinatorics, 2014 Let $D$ be a digraph with skew-adjacency matrix $S(D)$. Then the skew energy of $D$ is defined to be the sum of the norms of all eigenvalues of $S(D)$. Denote by $mathcal{O}_n$ the class of digraphs on order $n$ with no even cycles, and by $mathcal{O ...
Jing Li, Xueliang Li, Huishu Lian
doaj
Rough Neutrosophic Digraphs with Application
Axioms, 2018 A rough neutrosophic set model is a hybrid model which deals with vagueness by using the lower and upper approximation spaces. In this research paper, we apply the concept of rough neutrosophic sets to graphs. We introduce rough neutrosophic digraphs and
Sidra Sayed +3 more
doaj +1 more source
European Journal of Combinatorics, 1998 For a digraph \(G= (V,E)\) let \(\omega(G^n)\) denote the maximum possible cardinality of a subset \(S\) of \(V^n\) in which for every ordered pair of \(n\)-tuples \((u_1, u_2,\dots, u_n)\) and \((v_1, v_2,\dots, v_n)\) of members of \(S\) there is some \(i\) with \(1\leq i\leq n\) such that \((u_i,v_i)\in E\). The capacity \(C(G)\) of \(G\) is \(C(G)=
openaire +3 more sources
Corporate Social Responsibility and Environmental Management, EarlyView.ABSTRACT Growing concerns about the environmental and social consequences of plastics around the world, manufacturing industries are associated with business are focusing on sustainable end‐of‐life options‐based solutions which aim at increasing the product life cycle.
Sivakumar Kirupanandan +3 more
wiley +1 more source
Linkages in locally semicomplete digraphs and quasi-transitive digraphs [PDF]
, 1999 We consider two generalizations of tournaments, locally semicomplete digraphs introduced in Bang-Jensen (1990) and quasi-transitive digraphs introduced in Bang-Jensen and Huang (1995).
Bang-Jensen, Jørgen +2 more
core +1 more source
Journal of Graph Theory, EarlyView.ABSTRACT In this paper we define a degree for ends of infinite digraphs. The well‐definedness of our definition in particular resolves a problem by Zuther. Furthermore, we extend our notion of end degree to also respect, among others, the vertices dominating the end, which we denote as combined end degree.
Matthias Hamann, Karl Heuer
wiley +1 more source
Digraph homomorphisms on \(Z_n\)-digraph
Malaya Journal of Matematik, 2020 A graph homomorphism is a mapping between two graphs that respect their structure. In this paper we develop some results related to digraph homomorphisms for the class of \({\overrightarrow{Z_n}}^{-}\)-digraphs. We will begin by giving some standard definitions, then expanding our focus to specifically study different types of digraph homomorphisms. In
null Jimly Manuel, null Bindhu K Thomas
openaire +1 more source
Tree Independence Number III. Thetas, Prisms and Stars
Journal of Graph Theory, EarlyView.ABSTRACT We prove that for every t ∈ N $t\in {\mathbb{N}}$ there exists τ = τ ( t ) ∈ N $\tau =\tau (t)\in {\mathbb{N}}$ such that every (theta, prism, K 1 , t ${K}_{1,t}$)‐free graph has tree independence number at most τ $\tau $ (where we allow “prisms” to have one path of length zero).
Maria Chudnovsky +2 more
wiley +1 more source
, 2016 <p><strong>Version 0.6.0 (released 09/12/2016)</strong></p> <p>This is a major release, adding a variety of new operations and attributes<br> for Digraphs, as well as improving some functions and improving the<br ...
Markus Pfeiffer +15 more
core +1 more source