Keywords: Scattering number; Rupture degree; Connectivity; Genus; 5C05; 05C40;
مقالات ISI (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
Keywords: Connectivity; Generalized connectivity; Cartesian product; 05C76; 05C40;
Keywords: Wreath product; Complete graph; Cyclic graph; Wiener index; Adjacency matrix; Spectrum; 05C07; 05C12; 05C40; 05C50; 05C76;
Keywords: 05C20; 05C05; 05C75; 05C40; 05C70; Minimal strong digraphs; Trees; Characteristic polynomial; Nearly reducible matrices;
Keywords: 05B15; 05C40; 05C70; 05D15; Latin squares; Rainbow matchings; Connectedness;
Keywords: 05C50; 05C05; 05C75; 05C82; 05C40; 81Q35; 81P45; Symmetric; Laplacian; Quantum; Entropy; Bounds; Rényi;
Keywords: Generalized 3-connectivity; Internally disjoint trees; Cayley graphs; Star graphs; Bubble-sort graphs; 05C40; 90C35;
Keywords: 05C50; 05C05; 05C40; Eigenvalue; Algebraic connectivity; Edge connectivity; Spanning tree; Balloon;
Keywords: First Zagreb index (M1); Second Zagreb index (M2); Trees; Domination number05C05; 05C35; 05C40
Keywords: 15B51; 68R10; 05C99; 05C40; 05C05; Centrality; Eigenvector; PageRank; Topology; Network;
The λ3-connectivity and κ3-connectivity of recursive circulants
Keywords: Recursive circulant; λ3-connectivity; κ3-edge-connectivity; 05C05; 05C40; 05C76;
Towards a splitter theorem for internally 4-connected binary matroids VI
Keywords: 05B35; 05C40; Splitter theorem; Binary matroid; Internally 4-connected;
Hardness result for the total rainbow k-connection of graphs
Keywords: Total-rainbow k-connection number; Computational complexity; NP-complete; 05C15; 05C40; 68Q17; 68Q25; 68R10;
Rainbow connection numbers of Cayley digraphs on abelian groups
Keywords: Rainbow connection number; Cayley digraph; bi-Cayley graph; Interconnection networks; 05C15; 05C40;
The k-proper index of graphs
Keywords: Coloring of graphs; k-proper index; Characterization of graphs; 05C05; 05C15; 05C40;
Constructing edge-disjoint Steiner paths in lexicographic product networks
Keywords: Edge-connectivity; Steiner tree; Edge-disjoint Steiner paths; Packing; Path edge-connectivity; Lexicographic product; 05C05; 05C40; 05C70; 05C76;
Computing the F-index of nanostar dendrimers
Keywords: Topological index; Zagreb indices; F-index; Nanostar dendrimers; Primary: 05C35; Secondary: 05C07; 05C40;
The number of connected components in a graph associated with a rectangular (0,1)(0,1)-matrix
Keywords: 05C40; 05B20; 15A18; 15A24Chainable matrix; Connected component; Undirected graph; Incidence matrix; Adjacency matrix; Tensor product
Edge-disjoint spanning trees and eigenvalues of graphs
Keywords: 05C50; 15A18; 05C40; 15A42Edge-disjoint; Spanning tree; Eigenvalue; Connectivity
The total graph and regular graph of a commutative ring
Keywords: 05C40; 05C45; 16P10; 16P40
Counting perfect matchings in n-extendable graphs
Keywords: 05C70; 05C40; 05C75n-extendable graph; Perfect matching; Enumeration
Comparability graphs of lattices
Keywords: 06C10; 06C05; 05C40; 06D99; 05B25; 05B35; 06C20; 06E99
The k-path tree matroid and its applications to survivable network design
Keywords: 68R99; 05C40; Network connectivity; Algorithm; Matroid intersection;
How to contract an essentially 6-connected graph to a 5-connected graph
Keywords: 05C40; 05C83Connectivity; Contraction; Minor
Cuts leaving components of given minimum order
Keywords: 05C40; Edge-cut; Vertex-cut; Connectivity; Restricted edge-connectivity; Restricted vertex-connectivity;
Trivially noncontractible edges in a contraction critically 5-connected graph
Keywords: 05C40; 5-connected graph; Contractible edge; Contraction critically k-connected;
On Rayleigh-Ritz ratios of a generalized Laplacian matrix of directed graphs
Keywords: 05C20; 05C40; 05C50; 15A18; 37N35; 60J10; Connectivity; Directed graphs; Dynamical systems; Eigenvalues; Irreducible matrices; Laplacian matrix; Markov chains; Synchronization;
Double covers of cubic graphs with oddness 4
Keywords: 05C38; 05C40; 05C70; Cycle double cover; 2-factor; Oddness;
Contractible bonds in graphs
Keywords: 05C38; 05C40; 05C70; Bond; Minor; Contractible;