Keywords: Log-concavity; Unimodality; Independence polynomials; Recurrence relations; 05C69; 05A20;
مقالات ISI (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
Keywords: Independent set; Matching; Treewidth; Dynamic programming; 05C69; 05C80;
Keywords: Total dominating set; Efficient total dominating set; Total bondage number; Vertex-transitive graphs; 05C69;
Keywords: primary; 03D30; secondary; 03D80; 05C69; 37B10; Good approximations; Enumeration degrees; Density; Cototal enumeration degrees;
Keywords: 05C69; 05C85; Grundy total domination number; Vertex cover; Tree; Split graph; Modular decomposition;
Keywords: 05A16; 05C30; 05C69; 37B50; 68R05; 82B20; 82B28; 82B80; Corner transfer matrix; Independent sets; Hard squares;
Keywords: 05C69; 3-rainbow domination number; 3-rainbow dominating function;
Keywords: 05A15; 05C69; 15A99Independent vertex set; Merrifield–Simmons index; Hard square; Enumeration
Keywords: 05C69; 90C10; 90C27; 90C57; 90C35; 90C39; Dominating set; Cardinality constraint; Tree; Polynomial-time algorithm; Integral polytope;
Keywords: 05C50; 05C69; 15A18; 15A42Laplacian matrix; Laplacian spectral radius; Domination number
Keywords: 05C50; 15B33; 05C69; 05C60; 05C45; Graph; Matrix; Endomorphism; Finite field; Independence number; Chromatic number;
Keywords: 57M15; 05C69; 55P15; 05C10Independence complexes; Graphs; Simplicial complexes; Homotopy types; Homotopy invariants
Matching of 5-γ-critical leafless graph with a cut edge
Keywords: Domination number; Critical; Perfect matching; Nontrivial cut edge; 05C69; 05C70;
The matcher game played in graphs
Keywords: 05C65; 05C69; Matcher game; Matching;
On k-rainbow independent domination in graphs
Keywords: Domination; k-rainbow independent domination; Nordhaus-Gaddum; 05C69;
Some transformations on multiplicative eccentricity resistance-distance and their applications
Keywords: Eccentricity; Resistance-distance; Multiplicative eccentricity resistance-distance; 05C69; 05C05;
On extremal cacti with respect to the Szeged index
Keywords: Szeged index; Cactus; Pendent vertex; 05C69; 05C05;
Grundy dominating sequences and zero forcing sets
Keywords: 05C69; 68Q25; 05C65; Grundy domination; Zero forcing; Z-sequence; L-sequence; Graph products; SierpiÅski graphs;
On two extensions of equimatchable graphs
Keywords: 05C70; 05C69; 05C51; 03D15; Minimum maximal matching; Equimatchable graph; Edge dominating set; Gallai-Edmonds decomposition; Parameterized complexity;
On the k-limited packing numbers in graphs
Keywords: 05C69; Domination number; k-limited packing; Nordhaus-Gaddum inequality; Open packing number; Packing number; Total domination number;
Special cycles in independence complexes and superfrustration in some lattices
Keywords: 55U10; 55P15; 05C69; 82B20Independence complex; Grid; Kagome lattice; Betti numbers; Simplicial homology
Dominating sets, packings, and the maximum degree
Keywords: 05C69; 05C70Domination; Packing; Covering; Claw-free graph
On the complement graph and defensive kk-alliances
Keywords: 05C69; 15C05Defensive alliances; Complement graph; Domination number; Independent set; NP-completeness
A note on domination, girth and minimum degree
Keywords: 05C69; 05C38Domination; Girth; Minimum degree
Trees with extremal numbers of maximal independent sets including the set of leaves
Keywords: 05C69; 05C05Maximal independent set; Trees
Remarks on the minus (signed) total domination in graphs
Keywords: 05C69; Minus total domination; Signed total domination; k-partite graph; Triangle-free graph;
Approximability results for the maximum and minimum maximal induced matching problems
Keywords: 68W25; 68Q17; 05C69; 05C70Combinatorial optimization; Induced matching; Bipartite graph; Approximability; NP-completeness
Optimal clustering of multipartite graphs
Keywords: 05C; 05C69; 05C99Graph theory; Clique-partitioning; Zahn's problem; Zahn index; Approximation of symmetric relations by equivalence relations; Clustering; Complexity; Matching
The bondage numbers and efficient dominations of vertex-transitive graphs
Keywords: 05C69; 05C20Bondage number; Efficient dominating set; Vertex-transitive graph
On the roots of independence polynomials of almost all very well-covered graphs
Keywords: 05C69; 05C05, (primary); 05E99; 05A20, (secondary)Stable set; Independence polynomial; Root; Well-covered graph; Clique-unique graph
Hereditarily dominated graphs
Keywords: 05C69; 05C38Dominating set; Dominating subgraph; Induced forbidden subgraph
Dominating direct products of graphs
Keywords: 05C69; 05C12Domination; Paired-domination; Upper domination; Direct product
Paired domination on interval and circular-arc graphs
Keywords: 05C69; 05C85; 68Q25; 68R10; 68W05Interval graph; Circular-arc graph; Paired domination
The bondage numbers of graphs with small crossing numbers
Keywords: 05C69; 05C12Bondage number; Domination number; Crossing number; Planar graph
Critical cyclic patterns related to the domination number of the torus
Keywords: 05C69; 68R10
Distance irredundance and connected domination numbers of a graph
Keywords: 05C69; k-Irredundance number; k-Domination number; Connected k-domination number; k-Independent domination number; k-Independent set;
On average lower independence and domination numbers in graphs
Keywords: 05C69; Average lower independence number; Average lower domination number; Extremal graph;
The number of independent sets in unicyclic graphs
Keywords: 05C69; 05C05; Unicyclic graphs; Independent sets; Bounds; Fibonacci numbers;