Keywords: دیفرانسیل; Digraphs; Half vertex transitive digraphs; Half double coset digraphs;
مقالات ISI دیفرانسیل (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
Keywords: دیفرانسیل; Digraphs; Descendant sets; Primitivity; High arc transitivity;
Keywords: دیفرانسیل; Digraphs; Cycles; Hamiltonian cycles; Bipartite balanced digraph; Pancyclic; Even pancyclic; Longest non-Hamiltonian cycles;
Keywords: دیفرانسیل; Digraphs; Rough set theory; Accuracy measure; Dependency measure; Dependency averages;
Keywords: دیفرانسیل; Typical structure; Digraphs; Oriented graphs; Counting graphs;
Keywords: دیفرانسیل; 58J53; 05C50; 05C20Isospectrality; Line graphs; Digraphs; Representation theory
Keywords: دیفرانسیل; 15B38; 15B51; 35F45; 35K50; 05C50; 05C90; 82C20; 05C21; Transport on networks; Perron-Frobenius theory; Digraphs; Line graphs; Reducible matrices; Imprimitive matrices; C0-semigroups;
Keywords: دیفرانسیل; Average consensus; Digraphs; Broadcast communication;
Keywords: دیفرانسیل; Digraphs; Acyclic disconnection; Girth; Semigirth; Projective planes
Keywords: دیفرانسیل; Transport on networks; Diffusion on networks; Graphs; Digraphs; Line graphs
Keywords: دیفرانسیل; Rainbow connection; Digraphs; Tournaments
Keywords: دیفرانسیل; Directed cuts; Digraphs; Maximal paths; Cycles
Keywords: دیفرانسیل; Vertex-distinguishing arc colorings; Balanced arc colorings; Equitable arc colorings; Digraphs
Linear preservers for the q-permanent, cycle q-permanent expansions, and positive crossings in digraphs
Keywords: دیفرانسیل; 15A15; 15A86; 05C20; 05C50; q-Permanent; Determinant; Polynomial identities; Digraphs; Permutations;
Bounds on the k-restricted arc connectivity of some bipartite tournaments
Keywords: دیفرانسیل; Digraphs; Bipartite; Tournament; Projective plane;
On diregular digraphs with degree two and excess two
Keywords: دیفرانسیل; Degree/diameter problem; Digraphs; Excess; Extremal digraphs;
Strong rainbow connection in digraphs
Keywords: دیفرانسیل; Strong rainbow connection; Digraphs; Tournaments;
Rainbow connections in digraphs
Keywords: دیفرانسیل; Rainbow connection; Rainbow vertex-connection; Total rainbow connection; Digraphs;
Noncrossing partitions, noncrossing graphs, and q-permanental equations
Keywords: دیفرانسیل; 15A15; 15B57; 05C20; 05C50; Digraphs; Graphs; Permutations; Permanent; Polynomial identities;
On the (di)graphs with (directed) proper connection number two
Keywords: دیفرانسیل; proper connection; digraphs; bipartite; even dicycles; NP-complete;
On a directed variation of the 1-2-3 and 1-2 Conjectures
Keywords: دیفرانسیل; 1-2-3 Conjecture; 1-2 Conjecture; Digraphs;
A new generalization of kernels in digraphs
Keywords: دیفرانسیل; Digraphs; Kernel; Kernel-perfect digraph;
On longest non-Hamiltonian cycles in digraphs with the conditions of Bang-Jensen, Gutin and Li
Keywords: دیفرانسیل; Digraphs; Cycles; Hamiltonian cycles; Longest non-Hamiltonian cycles;
A non-trivial upper bound on the threshold bias of the Oriented-cycle game
Keywords: دیفرانسیل; Orientation games; Digraphs; Cycles;
Relation between number of kernels (and generalizations) of a digraph and its partial line digraphs
Keywords: دیفرانسیل; Digraphs; in-domination; kernel; Grundy function;
Automorphisms of the zero-divisor graph of the ring of all nÃn matrices over a finite field
Keywords: دیفرانسیل; Digraphs; Automorphisms of a graph; Zero-divisor graphs;
Lower bounds of Nikiforov's energy over digraphs
Keywords: دیفرانسیل; 05C50; Digraphs; Energy; Eigenvalues; Singular values; Lower bounds;
Directed NLC-width
Keywords: دیفرانسیل; Directed NLC-width; Directed clique-width; Digraphs
Laplacian matrices and Alexandrov topologies of digraphs
Keywords: دیفرانسیل; 05C20; 05C50; 54A05; Digraphs; Alexandrov topology; Laplacian matrix;
Edge-disjoint paths in digraphs with bounded independence number
Keywords: دیفرانسیل; Disjoint paths; Digraphs; Tournaments; Linking problem; Polynomial-time algorithm; Independence number
Digraphs of bounded elimination width
Keywords: دیفرانسیل; Digraphs; Perfect elimination; Cops-and-robber games; Characterisations;
Weak CSR expansions and transience bounds in max-plus algebra
Keywords: دیفرانسیل; 15A18; 15A23; 90B35; Max-plus; Matrix powers; Transient; Periodicity; Digraphs;
Disjoint cycles with different length in 4-arc-dominated digraphs
Keywords: دیفرانسیل; Digraphs; Vertex-disjoint cycles; Minimum out-degree;
Characterization of asymmetric CKI- and KP-digraphs with covering number at most 3
Keywords: دیفرانسیل; Digraphs; Kernel; Covering number;
Covering digraphs with small indegrees or outdegrees by directed cuts
Keywords: دیفرانسیل; Covering; Directed cuts; Digraphs; Indegree; Outdegree
Consensus for multi-agent systems with inherent nonlinear dynamics under directed topologies
Keywords: دیفرانسیل; Consensus problem; Multi-agent systems; Digraphs; Fixed topology; Switching topologies
Covering the edges of digraphs in D(3,3)D(3,3) and D(4,4)D(4,4) with directed cuts
Keywords: دیفرانسیل; Covering; Directed cuts; Digraphs; Indegree; Outdegree
Classification of some countable descendant-homogeneous digraphs
Keywords: دیفرانسیل; Digraphs; Homogeneity
Efficient total domination in digraphs
Keywords: دیفرانسیل; Total domination; Efficient total domination; Digraphs; Domination in digraphs
Finding kernels or solving SAT
Keywords: دیفرانسیل; Digraphs; Kernel; Satisfiability; Propositional logic
Permutation Capacities and Oriented Infinite Paths
Keywords: دیفرانسیل; graph capacities; permutations; digraphs; Andréʼs problem;
Independent sets and non-augmentable paths in arc-locally in-semicomplete digraphs and quasi-arc-transitive digraphs
Keywords: دیفرانسیل; Digraphs; Arc-locally in-semicomplete digraphs; Quasi-arc-transitive digraphs; Independent sets; Non-augmentable paths;
Kernels by monochromatic paths in digraphs with covering number 2
Keywords: دیفرانسیل; Digraphs; Kernel by monochromatic paths; Covering number
The exponent of Cartesian product of cycles
Keywords: دیفرانسیل; Exponent; Cartesian product; Digraphs
The structure of strong arc-locally in-semicomplete digraphs
Keywords: دیفرانسیل; Digraphs; Arc-locally semicomplete digraphs; Semicomplete digraphs; Semicomplete bipartite digraphs
Integrated system fault diagnostics utilising digraph and fault tree-based approaches
Keywords: دیفرانسیل; Fault diagnostics; Fault trees; Digraphs
Triple-loop networks with arbitrarily many minimum distance diagrams
Keywords: دیفرانسیل; Multi-loop network; Initial ideal; Digraphs; Circulant graphs;
Paths partition with prescribed beginnings in digraphs: A Chvátal-ErdÅs condition approach
Keywords: دیفرانسیل; Digraphs; Vertex-partition; Vertex-connectivity; Chvátal-ErdÅs conditions;
HSAGA and its application for the construction of near-Moore digraphs
Keywords: دیفرانسیل; Digraphs; Moore bound; Diameter; Out-degree; Simulated Annealing; Genetic Algorithm; Degree/diameter problem
Markov models for digraph panel data: Monte Carlo-based derivative estimation
Keywords: دیفرانسیل; Digraphs; Continuous-time Markov process; Gradient estimation; Likelihood ratio/score function method; Variance reduction; Control variates