Maxima of the Q-index: Forbidden rainbow Hamilton paths, matchings and linear forests: Maxima of the \(Q\)-index: forbidden rainbow Hamilton paths, matchings and linear forests

Συγγραφείς: Zhang, Xinye, Li, Yongtao, Feng, Lihua, Liu, Weijun

Πηγή: Linear Algebra and its Applications. 720:213-244

Θεματικοί όροι: Eulerian and Hamiltonian graphs, Extremal problems in graph theory, rainbow Hamilton path, Graphs and linear algebra (matrices, eigenvalues, etc.), extremal graphs, maximum spectral radius, minimum spectral radius, signless Laplacian matrix, rainbow matching, shifting operation, \(Q\)-index, Kelmans operation, rainbow linear forests, Structural characterization of families of graphs, rank of graphs

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/8051562
https://doi.org/10.1016/j.laa.2025.05.004

Enhanced Cryptocurrency Volatility Forecasting via Local Linear Forests

Συγγραφείς: Noot, Joep^Aff3, Sifat, Imtiaz^Aff4

Συνεισφορές: Nahidi, Narmin, editor^Aff1, Zarifis, Alex, editor^Aff2

Πηγή: AI, FinTech, and the Future of Robo-Advisory : Risk Management and Ethical Considerations. :269-314

The Complexity of Decomposing a Graph into a Matching and a Bounded Linear Forest: The complexity of decomposing a graph into a matching and a bounded linear forest

Συγγραφείς: Agnijo Banerjee, João Pedro Marciano, Adva Mond, Jan Petr, Julien Portier

Πηγή: Journal of Graph Theory. 109:76-87

Θεματικοί όροι: FOS: Computer and information sciences, Computer Science - Computational Complexity, computational complexity, 68Q15, 68Q17, 68R10, 68R05, 05C70, graph decompositions, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), FOS: Mathematics, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), Mathematics - Combinatorics, linear forests, Combinatorics (math.CO), Computational Complexity (cs.CC), NP-completeness

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2304.03256
https://zbmath.org/8035807
https://doi.org/10.1002/jgt.23208

Hamiltonian Paths of $k$k-ary $n$n-cubes Avoiding Faulty Links and Passing Through Prescribed Linear Forests

Συγγραφείς: Yang, Y., Zhang, L.

Πηγή: IEEE Transactions on Parallel and Distributed Systems IEEE Trans. Parallel Distrib. Syst. Parallel and Distributed Systems, IEEE Transactions on. 33(7):1752-1760 Jul, 2022

On prescribed Hamilton laceability of hybrid-faulty star graphs

Συγγραφείς: Lu, Zai Ping, Xue, Shu Dan ^⁎

Πηγή: In Discrete Applied Mathematics 15 June 2025 368:72-81

The bipartite Turán number and spectral extremum for linear forests

Συγγραφείς: Ming-Zhu Chen, Ning Wang, Long-Tu Yuan, Xiao-Dong Zhang

Πηγή: Linear Algebra and its Applications. 676:150-173

Θεματικοί όροι: 05C35, 05C50, Extremal problems in graph theory, Graphs and linear algebra (matrices, eigenvalues, etc.), extremal graph theory, FOS: Mathematics, Mathematics - Combinatorics, bipartite Turán problem, linear forests, 0102 computer and information sciences, Combinatorics (math.CO), 0101 mathematics, Paths and cycles, 01 natural sciences

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2201.00453

Spectral radius and rainbow Hamilton paths of a graph

Συγγραφείς: He, Xiaocong ^a, Li, Yongtao ^b, Feng, Lihua ^{b, ⁎}

Πηγή: In Discrete Mathematics October 2024 347(10)

Exact generalized Turán numbers for even linear forests

Συγγραφείς: Chen, Ya-Hong ^a, Yang, Jia-Bao ^b, Yuan, Long-Tu ^b, Zhang, Ping ^{c, ⁎}

Πηγή: In Discrete Mathematics July 2024 347(7)

Hamiltonian paths and Hamiltonian cycles passing through prescribed linear forests in star graph with fault-tolerant edges

Συγγραφείς: Shudan Xue, Qingying Deng, Pingshan Li, Jianguo Chen 0001

Πηγή: Discrete Applied Mathematics. 334:68-80

Θεματικοί όροι: Eulerian and Hamiltonian graphs, fault-tolerant edges, Hamiltonian cycle, Applications of graph theory, prescribed Hamiltonian laceable, star graph, Hamiltonian path, Paths and cycles, prescribed linear forests

Περιγραφή αρχείου: application/xml

Complexity Results on the Decomposition of a Digraph into Directed Linear Forests and Out-Stars: Complexity results on the decomposition of a digraph into directed linear forests and out-stars

Συγγραφείς: Hörsch, Florian, Picasarri-Arrieta, Lucas

Συνεισφορές: PICASARRI-ARRIETA, LUCAS

Πηγή: The Electronic Journal of Combinatorics. 31

Θεματικοί όροι: \(\ell \)-bounded out-galaxy, FOS: Computer and information sciences, Discrete Mathematics (cs.DM), directed linear forests, arboricity, Directed graphs (digraphs), tournaments, arc-partitions, 0102 computer and information sciences, 01 natural sciences, directed stars, branchings, [MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO], Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Digraphs, \(k\)-bounded digraphs, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), 0101 mathematics, complexity, Computer Science - Discrete Mathematics

Περιγραφή αρχείου: application/xml; application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2401.09202
https://inria.hal.science/hal-04471664v2/document
https://inria.hal.science/hal-04471664v2

On the [formula omitted]-spectral radius of graphs without linear forests

Συγγραφείς: Chen, Ming-Zhu ^a, Liu, A-Ming ^a, Zhang, Xiao-Dong ^{⁎, b}

Πηγή: In Applied Mathematics and Computation 1 August 2023 450

Antimagic labeling of forests with sets of consecutive integers

Συγγραφείς: Eranda Dhananjaya, Wei-Tian Li

Πηγή: Discrete Applied Mathematics. 309:75-84

Θεματικοί όροι: Graph labelling (graceful graphs, bandwidth, etc.), antimagic labeling, linear forests, 0102 computer and information sciences, 0101 mathematics, odd trees, 01 natural sciences, star forests, Trees

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/7456381
https://doi.org/10.1016/j.dam.2021.11.002

Stability of Generalized Turán Number for Linear Forests

Συγγραφείς: Xue, Yisai^Aff1, Liu, Yichong^Aff1, Kang, Liying^{Aff1, Aff2, IDs0037302402781w_cor3}

Πηγή: Graphs and Combinatorics. 40(3)

Generalized Turán number for linear forests

Συγγραφείς: Zhu, Xiutao, Chen, Yaojun ^⁎

Πηγή: In Discrete Mathematics October 2022 345(10)

Generalized Turán Number of Even Linear Forests: Generalized Turán number of even linear forests

Συγγραφείς: Xiutao Zhu, Fangfang Zhang, Yaojun Chen

Πηγή: Graphs and Combinatorics. 37:1437-1449

Θεματικοί όροι: Graph theory, Extremal problems in graph theory, Turán number, even linear forests, 0102 computer and information sciences, 0101 mathematics, generalized Turán number, 01 natural sciences, Trees

Περιγραφή αρχείου: application/xml

On the anti-Ramsey number of forests

Συγγραφείς: Chunqiu Fang, Ervin Györi, Mei Lu, Jimeng Xiao

Πηγή: Discrete Applied Mathematics. 291:129-142

Θεματικοί όροι: anti-Ramsey numbers, double stars, Ramsey theory, FOS: Mathematics, Generalized Ramsey theory, Mathematics - Combinatorics, linear forests, Combinatorics (math.CO), 0102 computer and information sciences, 01 natural sciences, star forests

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://arxiv.org/pdf/1908.04129
http://arxiv.org/abs/1908.04129
https://zbmath.org/7327706
https://doi.org/10.1016/j.dam.2020.08.027

Ramsey numbers of path-matchings, covering designs, and 1-cores

Συγγραφείς: Louis DeBiasio, András Gyárfás, Gábor N. Sárközy

Πηγή: Journal of Combinatorial Theory, Series B. 146:124-140

Θεματικοί όροι: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Ramsey theory, FOS: Mathematics, Generalized Ramsey theory, Mathematics - Combinatorics, linear forests, Combinatorics (math.CO), 0102 computer and information sciences, covering designs, 0101 mathematics, graph-Ramsey theory, 01 natural sciences

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://arxiv.org/pdf/1909.01920
http://arxiv.org/abs/1909.01920

Complexity results on the decomposition of a digraph into directed linear forests and out-stars

Συγγραφείς: Hörsch, Florian, Picasarri-Arrieta, Lucas

Συνεισφορές: Helmholtz Center for Information Security Saarbrücken (CISPA), Combinatorics, Optimization and Algorithms for Telecommunications (COATI), Centre Inria d'Université Côte d'Azur, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-COMmunications, Réseaux, systèmes Embarqués et Distribués (Laboratoire I3S - COMRED), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (1965 - 2019) (UNS)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UniCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UniCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (1965 - 2019) (UNS)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UniCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UniCA), National Institute of Informatics (NII), ANR-19-CE48-0013,DIGRAPHS,Digraphes(2019), ANR-17-EURE-0004,UCA DS4H,UCA Systèmes Numériques pour l'Homme(2017)

Πηγή: EISSN: 1077-8926 ; The Electronic Journal of Combinatorics ; https://inria.hal.science/hal-04471664 ; The Electronic Journal of Combinatorics, 2024, 31 (P4.26), pp.40

Θεματικοί όροι: complexity, directed stars, directed linear forests, branchings, arboricity, arc-partitions, Digraphs, [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2401.09202; ARXIV: 2401.09202

Διαθεσιμότητα: https://inria.hal.science/hal-04471664
https://inria.hal.science/hal-04471664v2/document
https://inria.hal.science/hal-04471664v2/file/2401.09202v2.pdf

On the anti-Ramsey numbers of linear forests

Συγγραφείς: Xie, Tian-Ying ^a, Yuan, Long-Tu ^b

Πηγή: In Discrete Mathematics December 2020 343(12)

Embedding fault-free hamiltonian paths with prescribed linear forests into faulty ternary n-cubes

Συγγραφείς: Yang, Yuxing ^{a, b, ⁎}, Li, Jing ^c, Wang, Shiying ^a

Πηγή: In Theoretical Computer Science 3 May 2019 767:1-15