NSTL国家科技图书文献中心

1. Rational Index of Languages Defined by Grammars with Bounded Dimension of Parse Trees NSTL国家科技图书文献中心

Ekaterina Shemetova | Alexander Okhotin ... - 《Theory of computing systems》 - 2024,68(3) - 487～511 - 共25页

摘要： the amount of branching in a tree (with trees* in a* | at most k components (k-MCFG) and with a tree | {oddsidemargin}{-69pt} begin{document}$$frac{k}{2^{kd^2 - kd | Abstract The rational index ρLdocumentclass | [12pt]{minimal} usepackage{amsmath} usepackage{wasysym

关键词： Dimension of a parse tree | Strahler number | k-caterpillar trees | Rational index | Context-free grammars | Multiple context-free grammars | Quasi-rational languages

2. Testing the planar straight-line realizability of 2-trees with prescribed edge lengths☆ NSTL国家科技图书文献中心

Alegria, Carlos | Borrazzo, Manuel ... - 《European journal of combinatorics》 - 2024,119 - ARTN 103806～ - 共62页

摘要： complexity of the FEPR problem for weighted 2-trees, which | are K 4 -minor free. We show the NP-hardness of the | -time solvable if their dual tree is a caterpillar | -trees* is slice-wise polynomial in the length of the* | We study a classic problem introduced thirty

关键词： OUTERPLANAR GRAPHS | CONSTRAINTS

3. Sufficient Algorithm for Inclusion of Pattern Caterpillar in Text Tree NSTL国家科技图书文献中心

Daisuke Abe | Tomoya Miyazaki ... - 《2023 14th IIAI International Congress on Advanced Applied Informatics: IIAI-AAI 2023, Koriyama, Japan, 8-13 July 2023》 - International Congress on Advanced Applied Informatics - 2023, - 128～131 - 共4页

摘要： rooted labeled k-caterpillar(k-caterpillar, for short | -$caterpillar. It runs in $O(k(h+H)sigma)$ time, where h is | by using real data for caterpillars and trees* as k* | at most k. Then, we design the sufficient algorithm | to return “yes” implying that a pattern caterpillar

关键词： Vegetation | Informatics

4. Edge Irregularity Strength of Trees Generated Caterpillars NSTL国家科技图书文献中心

Charankumar Ganteda | Shobhalatha G ... - 《Contemporary innovations in engineering and management : Nandyal, India, 22-23 April 2022. [Volume B]》 - International Conference on Contemporary Innovations in Mechanical Engineering - 2023, - 080007-1～080007-4 - 共4页

摘要： force of trees generated from the set of caterpillar | ,?·?, k} is known as k-labeling. A cutting edge's weight | of a vertex k-labeling is as follows: an irregular | edge k-labeling of the graph G if for each two | dissimilar edges e and f, {formula}. The smallest k

关键词： edge irregularity strength | caterpillar graphs | generation of graphs | AMS Mathematics subject classification Numbers: 05C78 | 05C05

5. Constructing bounded degree graphs with prescribed degree and neighbor degree sequences NSTL国家科技图书文献中心

Cibej, Uros | Li, Aaron ... - 《Discrete Applied Mathematics》 - 2023,332 - 47～61 - 共15页

摘要：) caterpillar* G = (V, E) such that for all k, d(vk) = dk and* | demonstrated on trees* up to n = 1000 vertices. The average* | reconstruction time for trees* with 1000 vertices is still less* | Let D = (d1, d2, ... , dn) and F = (1, f2 | , ... , fn) be two sequences of positive integers. We

关键词： Degree sequences | Neighbor degree constraint | NMR spectroscopy

6. Hosoya Polynomial for Subdivided Caterpillar Graphs SCIE Web of Science核心 NSTL国家科技图书文献中心

Numan, Muhammad | Nawaz, Aamra ... - 《Combinatorial chemistry & high throughput screening》 - 2022,25(3) - 554～559 - 共6页

摘要：. Caterpillar* trees are used in chemical graph theory to* | Hosoya polynomial for subdivided caterpillar trees | graph. Conclusion: Caterpillar* trees are among the* | caterpillar trees. The idea of the present research article | molecules. In this representation, one forms a caterpillar

关键词： Hosoya polynomial | wiener index | hyper-wiener index | caterpillar graph | uniform subdivision | diameter | WIENER INDEX | DECOMPOSITION

7. Antimagic orientation of subdivided caterpillars SCIE Web of Science核心 EI 工程索引 NSTL国家科技图书文献中心

Ferraro, Jessica | Newkirk, Genevieve ... - 《Discrete Applied Mathematics》 - 2022,313 - 45～52 - 共8页 - 被引量：2

摘要： caterpillars and complete k-ary trees. We prove that every | vertex of degree zero or two, and trees* including* | subdivided caterpillar* admits an antimagic orientation* | , where a subdivided caterpillar* is a subdivision of a* | caterpillar T such that the edges of T that are not on the

关键词： Caterpillar | Subdivided caterpillar | Antimagic labeling | Antimagic orientation

8. Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions EI 工程索引 SCIE Web of Science核心 SCOPUS Scopus数据库 NSTL国家科技图书文献中心

Hasunuma, Toru - 《Algorithmica》 - 2021,83(9) - 2697～2718 - 共22页 - 被引量：3

摘要： of order m, every k-connected graph G with minimum | such that G - V(T') is k-connected. This conjecture | has been proved for k = 1; however, it remains open | for general k >= 2; for k = 2, partially | the class of trees* to special subclasses such as*

关键词： 2-connected graphs | Connectivity | Girth | Trees

9. Augmenting a Tree to a kArbor-Connected Graph with Pagenumber k NSTL国家科技图书文献中心

Toru Hasunuma - 《Combinatorial Algorithms: 32nd International Workshop, IWOCA 2021, Ottawa, ON, Canada, July 5-7, 2021, Proceedings》 - International Workshop on Combinatorial Algorithms - 2021, - 356～369 - 共14页

摘要： graph which has k spanning trees* such that for any two* | vertices, the k paths between them in the spanning trees | bound on k can be removed if T is a caterpillar | -embeddings. A k-arbor-connected graph is defined to be a | -disjoint. A minimally k-arbor-connected graph is a k

关键词： Arbor-connectedness | Augmentation | Cactus | Pagenumber | Trees

NSTL主题词： Trees | Line graph

10. On the Colijn-Plazzotta numbering scheme for unlabeled binary rooted trees SCIE Web of Science核心 SCOPUS Scopus数据库 EI 工程索引 NSTL国家科技图书文献中心

Rosenberg, Noah A. - 《Discrete Applied Mathematics》 - 2021,291 - 88～98 - 共11页 - 被引量：3

摘要： rooted trees* with the positive integers. First, the* | recursively, ordered pair (k(1), k(2)), k(1) >= k(2) >= 1 | has rank k(1) and whose right subtree has rank k(2 | ranks (k(1), k(2)) is assigned rank k(1)(k(1)-1)/2 + 1 | + k(2). With this ranking, given a number of leaves

摘要： the amount of branching in a tree (with trees* in a* | at most k components (k-MCFG) and with a tree | {oddsidemargin}{-69pt} begin{document}$$frac{k}{2^{kd^2 - kd | Abstract The rational index ρLdocumentclass | [12pt]{minimal} usepackage{amsmath} usepackage{wasysym

关键词： Dimension of a parse tree | Strahler number | k-caterpillar trees | Rational index | Context-free grammars | Multiple context-free grammars | Quasi-rational languages

摘要： complexity of the FEPR problem for weighted 2-trees, which | are K 4 -minor free. We show the NP-hardness of the | -time solvable if their dual tree is a caterpillar | -trees* is slice-wise polynomial in the length of the* | We study a classic problem introduced thirty

关键词： OUTERPLANAR GRAPHS | CONSTRAINTS

摘要： rooted labeled k-caterpillar(k-caterpillar, for short | -$caterpillar. It runs in $O(k(h+H)sigma)$ time, where h is | by using real data for caterpillars and trees* as k* | at most k. Then, we design the sufficient algorithm | to return “yes” implying that a pattern caterpillar

关键词： Vegetation | Informatics

摘要： force of trees generated from the set of caterpillar | ,?·?, k} is known as k-labeling. A cutting edge's weight | of a vertex k-labeling is as follows: an irregular | edge k-labeling of the graph G if for each two | dissimilar edges e and f, {formula}. The smallest k

关键词： edge irregularity strength | caterpillar graphs | generation of graphs | AMS Mathematics subject classification Numbers: 05C78 | 05C05

关键词： Degree sequences | Neighbor degree constraint | NMR spectroscopy

摘要：. Caterpillar* trees are used in chemical graph theory to* | Hosoya polynomial for subdivided caterpillar trees | graph. Conclusion: Caterpillar* trees are among the* | caterpillar trees. The idea of the present research article | molecules. In this representation, one forms a caterpillar

关键词： Hosoya polynomial | wiener index | hyper-wiener index | caterpillar graph | uniform subdivision | diameter | WIENER INDEX | DECOMPOSITION

关键词： Caterpillar | Subdivided caterpillar | Antimagic labeling | Antimagic orientation

摘要： of order m, every k-connected graph G with minimum | such that G - V(T') is k-connected. This conjecture | has been proved for k = 1; however, it remains open | for general k >= 2; for k = 2, partially | the class of trees* to special subclasses such as*

关键词： 2-connected graphs | Connectivity | Girth | Trees

摘要： graph which has k spanning trees* such that for any two* | vertices, the k paths between them in the spanning trees | bound on k can be removed if T is a caterpillar | -embeddings. A k-arbor-connected graph is defined to be a | -disjoint. A minimally k-arbor-connected graph is a k

关键词： Arbor-connectedness | Augmentation | Cactus | Pagenumber | Trees

NSTL主题词： Trees | Line graph

摘要： rooted trees* with the positive integers. First, the* | recursively, ordered pair (k(1), k(2)), k(1) >= k(2) >= 1 | has rank k(1) and whose right subtree has rank k(2 | ranks (k(1), k(2)) is assigned rank k(1)(k(1)-1)/2 + 1 | + k(2). With this ranking, given a number of leaves

关键词： Phylogenetics | Quadratic recursion | Unlabeled trees

4008-161-200 800-990-8900

国家科技图书文献中心

摘要： the amount of branching in a tree (with trees in a | at most k components (k-MCFG) and with a tree | {oddsidemargin}{-69pt} begin{document}$$frac{k}{2^{kd^2 - kd | Abstract The rational index ρLdocumentclass | [12pt]{minimal} usepackage{amsmath} usepackage{wasysym

关键词： Dimension of a parse tree | Strahler number | k-caterpillar trees | Rational index | Context-free grammars | Multiple context-free grammars | Quasi-rational languages

摘要： complexity of the FEPR problem for weighted 2-trees, which | are K 4 -minor free. We show the NP-hardness of the | -time solvable if their dual tree is a caterpillar | -trees is slice-wise polynomial in the length of the | We study a classic problem introduced thirty

关键词： OUTERPLANAR GRAPHS | CONSTRAINTS

摘要： rooted labeled k-caterpillar(k-caterpillar, for short | -$caterpillar. It runs in $O(k(h+H)sigma)$ time, where h is | by using real data for caterpillars and trees as k | at most k. Then, we design the sufficient algorithm | to return “yes” implying that a pattern caterpillar

关键词： Vegetation | Informatics

摘要： force of trees generated from the set of caterpillar | ,?·?, k} is known as k-labeling. A cutting edge's weight | of a vertex k-labeling is as follows: an irregular | edge k-labeling of the graph G if for each two | dissimilar edges e and f, {formula}. The smallest k

关键词： edge irregularity strength | caterpillar graphs | generation of graphs | AMS Mathematics subject classification Numbers: 05C78 | 05C05

摘要：) caterpillar G = (V, E) such that for all k, d(vk) = dk and | demonstrated on trees up to n = 1000 vertices. The average | reconstruction time for trees with 1000 vertices is still less | Let D = (d1, d2, ... , dn) and F = (1, f2 | , ... , fn) be two sequences of positive integers. We

关键词： Degree sequences | Neighbor degree constraint | NMR spectroscopy

摘要：. Caterpillar trees are used in chemical graph theory to | Hosoya polynomial for subdivided caterpillar trees | graph. Conclusion: Caterpillar trees are among the | caterpillar trees. The idea of the present research article | molecules. In this representation, one forms a caterpillar

关键词： Hosoya polynomial | wiener index | hyper-wiener index | caterpillar graph | uniform subdivision | diameter | WIENER INDEX | DECOMPOSITION

摘要： caterpillars and complete k-ary trees. We prove that every | vertex of degree zero or two, and trees including | subdivided caterpillar admits an antimagic orientation | , where a subdivided caterpillar is a subdivision of a | caterpillar T such that the edges of T that are not on the

关键词： Caterpillar | Subdivided caterpillar | Antimagic labeling | Antimagic orientation

摘要： of order m, every k-connected graph G with minimum | such that G - V(T') is k-connected. This conjecture | has been proved for k = 1; however, it remains open | for general k >= 2; for k = 2, partially | the class of trees to special subclasses such as

关键词： 2-connected graphs | Connectivity | Girth | Trees

摘要： graph which has k spanning trees such that for any two | vertices, the k paths between them in the spanning trees | bound on k can be removed if T is a caterpillar | -embeddings. A k-arbor-connected graph is defined to be a | -disjoint. A minimally k-arbor-connected graph is a k

关键词： Arbor-connectedness | Augmentation | Cactus | Pagenumber | Trees

NSTL主题词： Trees | Line graph

摘要： rooted trees with the positive integers. First, the | recursively, ordered pair (k(1), k(2)), k(1) >= k(2) >= 1 | has rank k(1) and whose right subtree has rank k(2 | ranks (k(1), k(2)) is assigned rank k(1)(k(1)-1)/2 + 1 | + k(2). With this ranking, given a number of leaves

关键词： Phylogenetics | Quadratic recursion | Unlabeled trees

4008-161-200 800-990-8900

国家科技图书文献中心

摘要： the amount of branching in a tree (with trees* in a* | at most k components (k-MCFG) and with a tree | {oddsidemargin}{-69pt} begin{document}$$frac{k}{2^{kd^2 - kd | Abstract The rational index ρLdocumentclass | [12pt]{minimal} usepackage{amsmath} usepackage{wasysym

摘要： complexity of the FEPR problem for weighted 2-trees, which | are K 4 -minor free. We show the NP-hardness of the | -time solvable if their dual tree is a caterpillar | -trees* is slice-wise polynomial in the length of the* | We study a classic problem introduced thirty

摘要： rooted labeled k-caterpillar(k-caterpillar, for short | -$caterpillar. It runs in $O(k(h+H)sigma)$ time, where h is | by using real data for caterpillars and trees* as k* | at most k. Then, we design the sufficient algorithm | to return “yes” implying that a pattern caterpillar

摘要：. Caterpillar* trees are used in chemical graph theory to* | Hosoya polynomial for subdivided caterpillar trees | graph. Conclusion: Caterpillar* trees are among the* | caterpillar trees. The idea of the present research article | molecules. In this representation, one forms a caterpillar

摘要： of order m, every k-connected graph G with minimum | such that G - V(T') is k-connected. This conjecture | has been proved for k = 1; however, it remains open | for general k >= 2; for k = 2, partially | the class of trees* to special subclasses such as*

摘要： graph which has k spanning trees* such that for any two* | vertices, the k paths between them in the spanning trees | bound on k can be removed if T is a caterpillar | -embeddings. A k-arbor-connected graph is defined to be a | -disjoint. A minimally k-arbor-connected graph is a k

摘要： rooted trees* with the positive integers. First, the* | recursively, ordered pair (k(1), k(2)), k(1) >= k(2) >= 1 | has rank k(1) and whose right subtree has rank k(2 | ranks (k(1), k(2)) is assigned rank k(1)(k(1)-1)/2 + 1 | + k(2). With this ranking, given a number of leaves