NSTL国家科技图书文献中心

1. Characterization of graphs with the limited normalized algebraic connectivity NSTL国家科技图书文献中心

Sun, Shaowei | Sun, Xia - 《Discrete Applied Mathematics》 - 2025,362 - 61～70 - 共10页

摘要： with rho n-1 >= 3n-8 3n-9 by using forbidden subgraph | The normalized algebraic connectivity of a | graph with order n, denoted by rho n-1, is the second | smallest eigenvalue of the normalized Laplacian matrix of | the graph. In this paper, we determine the graphs

关键词： Normalized algebraic connectivity | Graph | Bipartite graph | Forbidden subgraph

2. Disconnected forbidden pairs force supereulerian graphs to be hamiltonian NSTL国家科技图书文献中心

Wang, Qiang | Xiong, Liming - 《Discrete mathematics》 - 2025,348(2) - 共11页

摘要： a spanning eulerian subgraph, i.e., a spanning | connected even subgraph. A graph is called hamiltonian if | induced subgraph. Yang et al. characterized all pairs of | disconnected forbidden* graph R, S. We characterize all pairs* | forbidden pairs for the existence of a Hamiltonian cycle

关键词： Forbidden subgraph | Disconnected subgraph | Supereulerian graphs | Hamiltonian graphs

3. On extremal values of some degree-based topological indices with a forbidden or a prescribed subgraph NSTL国家科技图书文献中心

Gerbner, Daniel - 《Discrete Applied Mathematics》 - 2025,360 - 459～466 - 共8页

摘要： also extend our investigations to other forbidden | Xu in 2011 determined the largest value of the | second Zagreb index in an n-vertex graph G with clique | number k, and also the smallest value with the | additional assumption that G is connected. We extend these

关键词： Zagreb index | Degree-based topological index | Generalized Tur & aacute;n problem | Kite graph

4. Every 3-connected { K 1,3 , Γ 3 }-free graph is Hamilton-connected NSTL国家科技图书文献中心

Kabela, Adam | Ryjacek, Zdenek ... - 《Discrete mathematics》 - 2025,348(2) - 共19页

摘要： characterization of pairs of connected forbidden* subgraphs* | We show that every 3-connected { K (1,3 | ) , Gamma(3) }- free graph is Hamilton-connected, where | Gamma(3) is the graph obtained by joining two vertex | -disjoint triangles with a path of length 3. This resolves

关键词： Hamilton-connected | Closure | Forbidden subgraph | Claw-free | Gamma(3)-free

5. Edge-apexing in hereditary classes of graphs NSTL国家科技图书文献中心

Singh, Jagdeep | Sivaraman, Vaidy - 《Discrete mathematics》 - 2025,348(1) - 共7页

摘要： finitely many forbidden* induced subgraphs, then so does* | subgraph. For the class of edge-apex cographs our main | result bounds the order of such forbidden* induced* | A class g of graphs is called hereditary if it | is closed under taking induced subgraphs. We denote

关键词： Cograph | Edge-apex graph | Forbidden induced subgraph

6. Connected triangle-free planar graphs whose second largest eigenvalue is at most 1 NSTL国家科技图书文献中心

Cheng, Kun | Li, Shuchao - 《Computational and Applied Mathematics》 - 2025,44(1) - 共22页

摘要：Let lambda 2documentclass[12pt]{minimal | } usepackage{amsmath} usepackage{wasysym} usepackage{amsfonts | } usepackage{amssymb} usepackage{amsbsy} usepackage{mathrsfs | } usepackage{upgreek} setlength{oddsidemargin}{-69pt} begin | {document}$$lambda _2$$end{document} be the second largest

关键词： Graph spectrum | Second largest eigenvalue | Planar graph | Forbidden induced subgraph

7. A subquadratic certification scheme for P5-free graphs NSTL国家科技图书文献中心

Bousquet, Nicolas | Zeitoun, Sebastien - 《Theoretical computer science》 - 2025,1033 - 共7页

摘要：In local certification, vertices of a n-vertex | graph perform a local verification to check if a given | property is satisfied by the graph. This verification is | performed thanks to certificates, which are pieces of | information that are given to the vertices. In this work, we

关键词： Local certification | Proof labeling scheme | Locally checkable proofs | Subgraph detection | Forbidden subgraphs | Polynomial regime

8. Recoloring some hereditary graph classes NSTL国家科技图书文献中心

Belavadi, Manoj | Cameron, Kathie - 《Discrete Applied Mathematics》 - 2025,361 - 389～401 - 共13页

摘要： classes restricted by forbidden* induced subgraphs. We* | The reconfiguration graph of the k-colorings | , denoted R k ( G ), is the graph whose vertices are the k | -colorings of G and two colorings are adjacent in R k ( G | ) if they differ in color on exactly one vertex. A

关键词： Reconfiguration graph | Forbidden induced subgraph | k-coloring | k-mixing | Frozen coloring

9. Almost Congruent Triangles NSTL国家科技图书文献中心

Balogh, Jozsef | Clemen, Felix Christ...... - 《Discrete & computational geometry》 - 2025,73(3) - 764～784 - 共21页

摘要：}, which contains no hypergraph as a subgraph* from a* | family of forbidden* hypergraphs F=F(T)documentclass* | Almost 50 years ago Erdos and Purdy asked the | following question: Given n points in the plane, how many | triangles can be approximate congruent to equilateral

关键词： Congruent triangles | Hypergraphs | Lagrangian method

10. Extremal results on feedback arc sets in digraphs NSTL国家科技图书文献中心

Fox, Jacob | Himwich, Zoe ... - 《Random structures & algorithms》 - 2024,64(2) - 287～308 - 共22页

摘要： oriented graph G has a fixed forbidden* subgraph B, the* | edge subset whose deletion leaves an acyclic subgraph | forbidden subgraphs. Our upper bounds come equipped with | For an oriented graph G, let beta(G) denote | the size of a minimum feedback arc set, a smallest

摘要： with rho n-1 >= 3n-8 3n-9 by using forbidden subgraph | The normalized algebraic connectivity of a | graph with order n, denoted by rho n-1, is the second | smallest eigenvalue of the normalized Laplacian matrix of | the graph. In this paper, we determine the graphs

关键词： Normalized algebraic connectivity | Graph | Bipartite graph | Forbidden subgraph

摘要： a spanning eulerian subgraph, i.e., a spanning | connected even subgraph. A graph is called hamiltonian if | induced subgraph. Yang et al. characterized all pairs of | disconnected forbidden* graph R, S. We characterize all pairs* | forbidden pairs for the existence of a Hamiltonian cycle

关键词： Forbidden subgraph | Disconnected subgraph | Supereulerian graphs | Hamiltonian graphs

摘要： also extend our investigations to other forbidden | Xu in 2011 determined the largest value of the | second Zagreb index in an n-vertex graph G with clique | number k, and also the smallest value with the | additional assumption that G is connected. We extend these

关键词： Zagreb index | Degree-based topological index | Generalized Tur & aacute;n problem | Kite graph

摘要： characterization of pairs of connected forbidden* subgraphs* | We show that every 3-connected { K (1,3 | ) , Gamma(3) }- free graph is Hamilton-connected, where | Gamma(3) is the graph obtained by joining two vertex | -disjoint triangles with a path of length 3. This resolves

关键词： Hamilton-connected | Closure | Forbidden subgraph | Claw-free | Gamma(3)-free

摘要： finitely many forbidden* induced subgraphs, then so does* | subgraph. For the class of edge-apex cographs our main | result bounds the order of such forbidden* induced* | A class g of graphs is called hereditary if it | is closed under taking induced subgraphs. We denote

关键词： Cograph | Edge-apex graph | Forbidden induced subgraph

摘要：Let lambda 2documentclass[12pt]{minimal | } usepackage{amsmath} usepackage{wasysym} usepackage{amsfonts | } usepackage{amssymb} usepackage{amsbsy} usepackage{mathrsfs | } usepackage{upgreek} setlength{oddsidemargin}{-69pt} begin | {document}$$lambda _2$$end{document} be the second largest

关键词： Graph spectrum | Second largest eigenvalue | Planar graph | Forbidden induced subgraph

摘要：In local certification, vertices of a n-vertex | graph perform a local verification to check if a given | property is satisfied by the graph. This verification is | performed thanks to certificates, which are pieces of | information that are given to the vertices. In this work, we

关键词： Local certification | Proof labeling scheme | Locally checkable proofs | Subgraph detection | Forbidden subgraphs | Polynomial regime

摘要： classes restricted by forbidden* induced subgraphs. We* | The reconfiguration graph of the k-colorings | , denoted R k ( G ), is the graph whose vertices are the k | -colorings of G and two colorings are adjacent in R k ( G | ) if they differ in color on exactly one vertex. A

关键词： Reconfiguration graph | Forbidden induced subgraph | k-coloring | k-mixing | Frozen coloring

摘要：}, which contains no hypergraph as a subgraph* from a* | family of forbidden* hypergraphs F=F(T)documentclass* | Almost 50 years ago Erdos and Purdy asked the | following question: Given n points in the plane, how many | triangles can be approximate congruent to equilateral

关键词： Congruent triangles | Hypergraphs | Lagrangian method

摘要： oriented graph G has a fixed forbidden* subgraph B, the* | edge subset whose deletion leaves an acyclic subgraph | forbidden subgraphs. Our upper bounds come equipped with | For an oriented graph G, let beta(G) denote | the size of a minimum feedback arc set, a smallest

关键词： Directed graphs | extremal graph theory | feedback arc sets | forbidden subgraph | maximum acyclic subgraph | GRAPHS | SUBGRAPHS | CYCLES

4008-161-200 800-990-8900

国家科技图书文献中心

摘要： with rho n-1 >= 3n-8 3n-9 by using forbidden subgraph | The normalized algebraic connectivity of a | graph with order n, denoted by rho n-1, is the second | smallest eigenvalue of the normalized Laplacian matrix of | the graph. In this paper, we determine the graphs

关键词： Normalized algebraic connectivity | Graph | Bipartite graph | Forbidden subgraph

摘要： a spanning eulerian subgraph, i.e., a spanning | connected even subgraph. A graph is called hamiltonian if | induced subgraph. Yang et al. characterized all pairs of | disconnected forbidden graph R, S. We characterize all pairs | forbidden pairs for the existence of a Hamiltonian cycle

关键词： Forbidden subgraph | Disconnected subgraph | Supereulerian graphs | Hamiltonian graphs

摘要： also extend our investigations to other forbidden | Xu in 2011 determined the largest value of the | second Zagreb index in an n-vertex graph G with clique | number k, and also the smallest value with the | additional assumption that G is connected. We extend these

关键词： Zagreb index | Degree-based topological index | Generalized Tur & aacute;n problem | Kite graph

摘要： characterization of pairs of connected forbidden subgraphs | We show that every 3-connected { K (1,3 | ) , Gamma(3) }- free graph is Hamilton-connected, where | Gamma(3) is the graph obtained by joining two vertex | -disjoint triangles with a path of length 3. This resolves

关键词： Hamilton-connected | Closure | Forbidden subgraph | Claw-free | Gamma(3)-free

摘要： finitely many forbidden induced subgraphs, then so does | subgraph. For the class of edge-apex cographs our main | result bounds the order of such forbidden induced | A class g of graphs is called hereditary if it | is closed under taking induced subgraphs. We denote

关键词： Cograph | Edge-apex graph | Forbidden induced subgraph

摘要：Let lambda 2documentclass[12pt]{minimal | } usepackage{amsmath} usepackage{wasysym} usepackage{amsfonts | } usepackage{amssymb} usepackage{amsbsy} usepackage{mathrsfs | } usepackage{upgreek} setlength{oddsidemargin}{-69pt} begin | {document}$$lambda _2$$end{document} be the second largest

关键词： Graph spectrum | Second largest eigenvalue | Planar graph | Forbidden induced subgraph

摘要：In local certification, vertices of a n-vertex | graph perform a local verification to check if a given | property is satisfied by the graph. This verification is | performed thanks to certificates, which are pieces of | information that are given to the vertices. In this work, we

关键词： Local certification | Proof labeling scheme | Locally checkable proofs | Subgraph detection | Forbidden subgraphs | Polynomial regime

摘要： classes restricted by forbidden induced subgraphs. We | The reconfiguration graph of the k-colorings | , denoted R k ( G ), is the graph whose vertices are the k | -colorings of G and two colorings are adjacent in R k ( G | ) if they differ in color on exactly one vertex. A

关键词： Reconfiguration graph | Forbidden induced subgraph | k-coloring | k-mixing | Frozen coloring

摘要：}, which contains no hypergraph as a subgraph from a | family of forbidden hypergraphs F=F(T)documentclass | Almost 50 years ago Erdos and Purdy asked the | following question: Given n points in the plane, how many | triangles can be approximate congruent to equilateral

关键词： Congruent triangles | Hypergraphs | Lagrangian method

摘要： oriented graph G has a fixed forbidden subgraph B, the | edge subset whose deletion leaves an acyclic subgraph | forbidden subgraphs. Our upper bounds come equipped with | For an oriented graph G, let beta(G) denote | the size of a minimum feedback arc set, a smallest

关键词： Directed graphs | extremal graph theory | feedback arc sets | forbidden subgraph | maximum acyclic subgraph | GRAPHS | SUBGRAPHS | CYCLES

4008-161-200 800-990-8900

国家科技图书文献中心

摘要： a spanning eulerian subgraph, i.e., a spanning | connected even subgraph. A graph is called hamiltonian if | induced subgraph. Yang et al. characterized all pairs of | disconnected forbidden* graph R, S. We characterize all pairs* | forbidden pairs for the existence of a Hamiltonian cycle

摘要： characterization of pairs of connected forbidden* subgraphs* | We show that every 3-connected { K (1,3 | ) , Gamma(3) }- free graph is Hamilton-connected, where | Gamma(3) is the graph obtained by joining two vertex | -disjoint triangles with a path of length 3. This resolves

摘要： finitely many forbidden* induced subgraphs, then so does* | subgraph. For the class of edge-apex cographs our main | result bounds the order of such forbidden* induced* | A class g of graphs is called hereditary if it | is closed under taking induced subgraphs. We denote

摘要： classes restricted by forbidden* induced subgraphs. We* | The reconfiguration graph of the k-colorings | , denoted R k ( G ), is the graph whose vertices are the k | -colorings of G and two colorings are adjacent in R k ( G | ) if they differ in color on exactly one vertex. A

摘要：}, which contains no hypergraph as a subgraph* from a* | family of forbidden* hypergraphs F=F(T)documentclass* | Almost 50 years ago Erdos and Purdy asked the | following question: Given n points in the plane, how many | triangles can be approximate congruent to equilateral

摘要： oriented graph G has a fixed forbidden* subgraph B, the* | edge subset whose deletion leaves an acyclic subgraph | forbidden subgraphs. Our upper bounds come equipped with | For an oriented graph G, let beta(G) denote | the size of a minimum feedback arc set, a smallest