Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Tingzeng Wu
@article{DBLP:journals/amc/ChenHJW23, author = {Zhouyang Chen and Zhi Hu and Wei Jin and Tingzeng Wu}, title = {On the (Q-)index of 2-domination critical graphs}, journal = {Appl. Math. Comput.}, volume = {438}, pages = {127557}, year = {2023}, url = {https://doi.org/10.1016/j.amc.2022.127557}, doi = {10.1016/J.AMC.2022.127557}, timestamp = {Sun, 13 Nov 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/amc/ChenHJW23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/amc/WuYG23, author = {Tingzeng Wu and Yong Yu and Xing Gao}, title = {The second immanantal polynomials of Laplacian matrices of unicyclic graphs}, journal = {Appl. Math. Comput.}, volume = {451}, pages = {128038}, year = {2023}, url = {https://doi.org/10.1016/j.amc.2023.128038}, doi = {10.1016/J.AMC.2023.128038}, timestamp = {Fri, 02 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/amc/WuYG23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cam/DengLW23, author = {Kai Deng and Huazhong L{\"{u}} and Tingzeng Wu}, title = {Forcing and anti-forcing polynomials of a type of polyomino graphs}, journal = {Comput. Appl. Math.}, volume = {42}, number = {2}, year = {2023}, url = {https://doi.org/10.1007/s40314-023-02228-7}, doi = {10.1007/S40314-023-02228-7}, timestamp = {Mon, 22 May 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cam/DengLW23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/gc/WuZL23, author = {Tingzeng Wu and Xiaolin Zeng and Huazhong L{\"{u}}}, title = {On the Roots of (Signless) Laplacian Permanental Polynomials of Graphs}, journal = {Graphs Comb.}, volume = {39}, number = {6}, pages = {113}, year = {2023}, url = {https://doi.org/10.1007/s00373-023-02710-3}, doi = {10.1007/S00373-023-02710-3}, timestamp = {Thu, 09 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/gc/WuZL23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/amc/WuZL22, author = {Tingzeng Wu and Tian Zhou and Huazhong L{\"{u}}}, title = {Further results on the star degree of graphs}, journal = {Appl. Math. Comput.}, volume = {425}, pages = {127076}, year = {2022}, url = {https://doi.org/10.1016/j.amc.2022.127076}, doi = {10.1016/J.AMC.2022.127076}, timestamp = {Wed, 07 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/amc/WuZL22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/WuS21, author = {Tingzeng Wu and Wasin So}, title = {Permanental sums of graphs of extreme sizes}, journal = {Discret. Math.}, volume = {344}, number = {6}, pages = {112353}, year = {2021}, url = {https://doi.org/10.1016/j.disc.2021.112353}, doi = {10.1016/J.DISC.2021.112353}, timestamp = {Thu, 29 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dm/WuS21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/gc/SoWL21, author = {Wasin So and Tingzeng Wu and Huazhong L{\"{u}}}, title = {Sharp Bounds on the Permanental Sum of a Graph}, journal = {Graphs Comb.}, volume = {37}, number = {6}, pages = {2423--2437}, year = {2021}, url = {https://doi.org/10.1007/s00373-021-02365-y}, doi = {10.1007/S00373-021-02365-Y}, timestamp = {Wed, 07 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/gc/SoWL21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ijfcs/LuW21, author = {Huazhong L{\"{u}} and Tingzeng Wu}, title = {Unpaired Many-to-Many Disjoint Path Cover of Balanced Hypercubest}, journal = {Int. J. Found. Comput. Sci.}, volume = {32}, number = {8}, pages = {943--956}, year = {2021}, url = {https://doi.org/10.1142/S0129054121500301}, doi = {10.1142/S0129054121500301}, timestamp = {Wed, 07 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ijfcs/LuW21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2110-05917, author = {Huazhong L{\"{u}} and Tingzeng Wu}, title = {On the complexity of structure and substructure connectivity of graphs}, journal = {CoRR}, volume = {abs/2110.05917}, year = {2021}, url = {https://arxiv.org/abs/2110.05917}, eprinttype = {arXiv}, eprint = {2110.05917}, timestamp = {Fri, 22 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2110-05917.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cam/WuD20, author = {Tingzeng Wu and Kinkar Chandra Das}, title = {On the permanental sum of bicyclic graphs}, journal = {Comput. Appl. Math.}, volume = {39}, number = {2}, year = {2020}, url = {https://doi.org/10.1007/s40314-020-1108-x}, doi = {10.1007/S40314-020-1108-X}, timestamp = {Fri, 21 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cam/WuD20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/LuW20, author = {Huazhong L{\"{u}} and Tingzeng Wu}, title = {On the conjecture of bijection between perfect matching and sub-hypercube in folded hypercubes}, journal = {Discret. Appl. Math.}, volume = {279}, pages = {192--194}, year = {2020}, url = {https://doi.org/10.1016/j.dam.2019.08.017}, doi = {10.1016/J.DAM.2019.08.017}, timestamp = {Sun, 22 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/LuW20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/amc/WuS19, author = {Tingzeng Wu and Wasin So}, title = {Unicyclic graphs with second largest and second smallest permanental sums}, journal = {Appl. Math. Comput.}, volume = {351}, pages = {168--175}, year = {2019}, url = {https://doi.org/10.1016/j.amc.2019.01.056}, doi = {10.1016/J.AMC.2019.01.056}, timestamp = {Fri, 21 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/amc/WuS19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/complexity/WuL19, author = {Tingzeng Wu and Huazhong L{\"{u}}}, title = {The Extremal Permanental Sum for a Quasi-Tree Graph}, journal = {Complex.}, volume = {2019}, pages = {4387650:1--4387650:4}, year = {2019}, url = {https://doi.org/10.1155/2019/4387650}, doi = {10.1155/2019/4387650}, timestamp = {Wed, 07 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/complexity/WuL19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dmtcs/LuW19, author = {Huazhong L{\"{u}} and Tingzeng Wu}, title = {Super edge-connectivity and matching preclusion of data center networks}, journal = {Discret. Math. Theor. Comput. Sci.}, volume = {21}, number = {4}, year = {2019}, url = {https://doi.org/10.23638/DMTCS-21-4-2}, doi = {10.23638/DMTCS-21-4-2}, timestamp = {Sun, 12 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dmtcs/LuW19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/LuW19, author = {Huazhong L{\"{u}} and Tingzeng Wu}, title = {Edge-disjoint Hamiltonian cycles of balanced hypercubes}, journal = {Inf. Process. Lett.}, volume = {144}, pages = {25--30}, year = {2019}, url = {https://doi.org/10.1016/j.ipl.2018.12.004}, doi = {10.1016/J.IPL.2018.12.004}, timestamp = {Wed, 13 Feb 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/LuW19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/join/LuW19, author = {Huazhong L{\"{u}} and Tingzeng Wu}, title = {Fractional Matching Preclusion for Restricted Hypercube-Like Graphs}, journal = {J. Interconnect. Networks}, volume = {19}, number = {3}, pages = {1940010:1--1940010:10}, year = {2019}, url = {https://doi.org/10.1142/S0219265919400103}, doi = {10.1142/S0219265919400103}, timestamp = {Fri, 05 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/join/LuW19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1912-05443, author = {Huazhong L{\"{u}} and Tingzeng Wu}, title = {Unpaired many-to-many disjoint path cover of balanced hypercubes}, journal = {CoRR}, volume = {abs/1912.05443}, year = {2019}, url = {http://arxiv.org/abs/1912.05443}, eprinttype = {arXiv}, eprint = {1912.05443}, timestamp = {Tue, 07 Jan 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-1912-05443.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/amc/WuL18, author = {Tingzeng Wu and Hong{-}Jian Lai}, title = {On the permanental sum of graphs}, journal = {Appl. Math. Comput.}, volume = {331}, pages = {334--340}, year = {2018}, url = {https://doi.org/10.1016/j.amc.2018.03.026}, doi = {10.1016/J.AMC.2018.03.026}, timestamp = {Fri, 21 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/amc/WuL18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/gc/WuL18, author = {Tingzeng Wu and Hong{-}Jian Lai}, title = {Constructing Graphs Which are Permanental Cospectral and Adjacency Cospectral}, journal = {Graphs Comb.}, volume = {34}, number = {6}, pages = {1713--1721}, year = {2018}, url = {https://doi.org/10.1007/s00373-018-1963-z}, doi = {10.1007/S00373-018-1963-Z}, timestamp = {Thu, 04 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/gc/WuL18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1807-05224, author = {Huazhong L{\"{u}} and Tingzeng Wu}, title = {Super edge-connectivity and matching preclusion of data center networks}, journal = {CoRR}, volume = {abs/1807.05224}, year = {2018}, url = {http://arxiv.org/abs/1807.05224}, eprinttype = {arXiv}, eprint = {1807.05224}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1807-05224.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1808-02375, author = {Huazhong L{\"{u}} and Tingzeng Wu}, title = {Structure and substructure connectivity of balanced hypercubes}, journal = {CoRR}, volume = {abs/1808.02375}, year = {2018}, url = {http://arxiv.org/abs/1808.02375}, eprinttype = {arXiv}, eprint = {1808.02375}, timestamp = {Sun, 02 Sep 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1808-02375.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/amc/LiuW17, author = {Xiaogang Liu and Tingzeng Wu}, title = {Computing the permanental polynomials of graphs}, journal = {Appl. Math. Comput.}, volume = {304}, pages = {103--113}, year = {2017}, url = {https://doi.org/10.1016/j.amc.2017.01.052}, doi = {10.1016/J.AMC.2017.01.052}, timestamp = {Tue, 29 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/amc/LiuW17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dmgt/WuZ17, author = {Tingzeng Wu and Heping Zhang}, title = {Per-spectral characterizations of some bipartite graphs}, journal = {Discuss. Math. Graph Theory}, volume = {37}, number = {4}, pages = {935--951}, year = {2017}, url = {https://doi.org/10.7151/dmgt.1981}, doi = {10.7151/DMGT.1981}, timestamp = {Mon, 08 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dmgt/WuZ17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/entropy/WuLZ17, author = {Tingzeng Wu and Huazhong L{\"{u}} and Xuexin Zhang}, title = {Extremal Matching Energy of Random Polyomino Chains}, journal = {Entropy}, volume = {19}, number = {12}, pages = {684}, year = {2017}, url = {https://doi.org/10.3390/e19120684}, doi = {10.3390/E19120684}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/entropy/WuLZ17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jam/WuL17, author = {Tingzeng Wu and Huazhong L{\"{u}}}, title = {Per-Spectral Characterizations of Bicyclic Networks}, journal = {J. Appl. Math.}, volume = {2017}, pages = {7541312:1--7541312:5}, year = {2017}, url = {https://doi.org/10.1155/2017/7541312}, doi = {10.1155/2017/7541312}, timestamp = {Thu, 16 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jam/WuL17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/WuZ16, author = {Tingzeng Wu and Heping Zhang}, title = {Per-spectral and adjacency spectral characterizations of a complete graph removing six edges}, journal = {Discret. Appl. Math.}, volume = {203}, pages = {158--170}, year = {2016}, url = {https://doi.org/10.1016/j.dam.2015.09.014}, doi = {10.1016/J.DAM.2015.09.014}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/WuZ16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dmgt/WuYZ16, author = {Tingzeng Wu and Weigen Yan and Heping Zhang}, title = {Extremal matching energy of complements of trees}, journal = {Discuss. Math. Graph Theory}, volume = {36}, number = {3}, pages = {505--521}, year = {2016}, url = {https://doi.org/10.7151/dmgt.1869}, doi = {10.7151/DMGT.1869}, timestamp = {Tue, 29 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dmgt/WuYZ16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/arscom/WuZ15, author = {Tingzeng Wu and Heping Zhang}, title = {Some analytical properties of the permanental polynomial of a graph}, journal = {Ars Comb.}, volume = {123}, pages = {261--267}, year = {2015}, timestamp = {Mon, 21 Sep 2015 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/arscom/WuZ15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/gc/ChenLMWX15, author = {Guantao Chen and Yinkui Li and Haicheng Ma and Tingzeng Wu and Liming Xiong}, title = {An Extension of the Chv{\'{a}}tal-Erd{\H{o}}s Theorem: Counting the Number of Maximum Independent Sets}, journal = {Graphs Comb.}, volume = {31}, number = {4}, pages = {885--896}, year = {2015}, url = {https://doi.org/10.1007/s00373-014-1416-2}, doi = {10.1007/S00373-014-1416-2}, timestamp = {Thu, 04 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/gc/ChenLMWX15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icica/WuM10, author = {Tingzeng Wu and Defu Ma}, editor = {Rongbo Zhu and Yanchun Zhang and Baoxiang Liu and Chunfeng Liu}, title = {On the Nullity Algorithm of Tree and Unicyclic Graph}, booktitle = {Information Computing and Applications - International Conference, {ICICA} 2010, Tangshan, China, October 15-18, 2010. Proceedings, Part {II}}, series = {Communications in Computer and Information Science}, volume = {106}, pages = {48--55}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-16339-5\_7}, doi = {10.1007/978-3-642-16339-5\_7}, timestamp = {Mon, 03 Sep 2018 00:14:34 +0200}, biburl = {https://dblp.org/rec/conf/icica/WuM10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iccS/WuXW07, author = {Qiuxin Wu and Liming Xiong and Tingzeng Wu}, editor = {Yong Shi and G. Dick van Albada and Jack J. Dongarra and Peter M. A. Sloot}, title = {Even Factors with Degree at Most Four in Claw-Free Graphs}, booktitle = {Computational Science - {ICCS} 2007, 7th International Conference, Beijing, China, May 27 - 30, 2007, Proceedings, Part {III}}, series = {Lecture Notes in Computer Science}, volume = {4489}, pages = {397--400}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-72588-6\_65}, doi = {10.1007/978-3-540-72588-6\_65}, timestamp = {Tue, 08 Nov 2022 08:34:35 +0100}, biburl = {https://dblp.org/rec/conf/iccS/WuXW07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.