Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Yingbin Ma
@article{DBLP:journals/join/MaZ24, author = {Yingbin Ma and Hui Zhang}, title = {The k-Total-Proper Index of Graphs}, journal = {J. Interconnect. Networks}, volume = {24}, number = {1}, pages = {2350011:1--2350011:17}, year = {2024}, url = {https://doi.org/10.1142/S0219265923500111}, doi = {10.1142/S0219265923500111}, timestamp = {Sat, 04 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/join/MaZ24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/amc/MaZ23a, author = {Yingbin Ma and Xiaoxue Zhang}, title = {Graphs with (strong) proper connection numbers m-3 and m-4}, journal = {Appl. Math. Comput.}, volume = {445}, pages = {127843}, year = {2023}, url = {https://doi.org/10.1016/j.amc.2023.127843}, doi = {10.1016/J.AMC.2023.127843}, timestamp = {Sun, 12 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/amc/MaZ23a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/amc/NieMS23, author = {Kairui Nie and Yingbin Ma and Elzbieta Sidorowicz}, title = {(Strong) Proper vertex connection of some digraphs}, journal = {Appl. Math. Comput.}, volume = {458}, pages = {128243}, year = {2023}, url = {https://doi.org/10.1016/j.amc.2023.128243}, doi = {10.1016/J.AMC.2023.128243}, timestamp = {Tue, 12 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/amc/NieMS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/axioms/MaZX23, author = {Yingbin Ma and Xiaoxue Zhang and Yanfeng Xue}, title = {Graphs with Strong Proper Connection Numbers and Large Cliques}, journal = {Axioms}, volume = {12}, number = {4}, pages = {353}, year = {2023}, url = {https://doi.org/10.3390/axioms12040353}, doi = {10.3390/AXIOMS12040353}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/axioms/MaZX23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/join/MaZ23, author = {Yingbin Ma and Wenhan Zhu}, title = {The 3-Vertex-Rainbow Index of 2-(Edge) Connected Graphs}, journal = {J. Interconnect. Networks}, volume = {23}, number = {1}, pages = {2150034:1--2150034:15}, year = {2023}, url = {https://doi.org/10.1142/S0219265921500341}, doi = {10.1142/S0219265921500341}, timestamp = {Sun, 25 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/join/MaZ23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/join/MaXZ23, author = {Yingbin Ma and Yanfeng Xue and Xiaoxue Zhang}, title = {Proper (Strong) Rainbow Connection and Proper (Strong) Rainbow Vertex Connection of Some Special Graphs}, journal = {J. Interconnect. Networks}, volume = {23}, number = {3}, pages = {2250006:1--2250006:19}, year = {2023}, url = {https://doi.org/10.1142/S0219265922500062}, doi = {10.1142/S0219265922500062}, timestamp = {Fri, 07 Jul 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/join/MaXZ23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/amc/MaZ22, author = {Yingbin Ma and Wenhan Zhu}, title = {Some results on the 3-total-rainbow index}, journal = {Appl. Math. Comput.}, volume = {427}, pages = {127128}, year = {2022}, url = {https://doi.org/10.1016/j.amc.2022.127128}, doi = {10.1016/J.AMC.2022.127128}, timestamp = {Wed, 01 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/amc/MaZ22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/axioms/LiMZ22, author = {Hengzhe Li and Yingbin Ma and Yan Zhao}, title = {Total Rainbow Connection Number of Some Graph Operations}, journal = {Axioms}, volume = {11}, number = {6}, pages = {254}, year = {2022}, url = {https://doi.org/10.3390/axioms11060254}, doi = {10.3390/AXIOMS11060254}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/axioms/LiMZ22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dmgt/0001LM21, author = {Xueliang Li and Hengzhe Li and Yingbin Ma}, title = {The vertex- rainbow connection number of some graph operations}, journal = {Discuss. Math. Graph Theory}, volume = {41}, number = {2}, pages = {513--530}, year = {2021}, url = {https://doi.org/10.7151/dmgt.2206}, doi = {10.7151/DMGT.2206}, timestamp = {Tue, 26 Jan 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dmgt/0001LM21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/MaN21, author = {Yingbin Ma and Kairui Nie}, title = {(Strong) Total proper connection of some digraphs}, journal = {J. Comb. Optim.}, volume = {42}, number = {1}, pages = {24--39}, year = {2021}, url = {https://doi.org/10.1007/s10878-021-00738-w}, doi = {10.1007/S10878-021-00738-W}, timestamp = {Tue, 20 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/MaN21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/join/MaZ21, author = {Yingbin Ma and Wenhan Zhu}, title = {Tight Upper Bound of the 3-Total-Rainbow Index for 2-(Edge-)Connected Graphs}, journal = {J. Interconnect. Networks}, volume = {21}, number = {4}, pages = {2142001:1--2142001:14}, year = {2021}, url = {https://doi.org/10.1142/S0219265921420019}, doi = {10.1142/S0219265921420019}, timestamp = {Wed, 18 May 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/join/MaZ21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/access/MaN19, author = {Yingbin Ma and Kairui Nie}, title = {(Strong) Proper Connection in Some Digraphs}, journal = {{IEEE} Access}, volume = {7}, pages = {69692--69697}, year = {2019}, url = {https://doi.org/10.1109/ACCESS.2019.2918368}, doi = {10.1109/ACCESS.2019.2918368}, timestamp = {Mon, 08 Jul 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/access/MaN19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/amc/MaNJW19, author = {Yingbin Ma and Kairui Nie and Fengxia Jin and Cui Wang}, title = {Total rainbow connection numbers of some special graphs}, journal = {Appl. Math. Comput.}, volume = {360}, pages = {213--220}, year = {2019}, url = {https://doi.org/10.1016/j.amc.2019.05.008}, doi = {10.1016/J.AMC.2019.05.008}, timestamp = {Fri, 21 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/amc/MaNJW19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/amc/ChenMSZ18, author = {Lily Chen and Yingbin Ma and Yongtang Shi and Yan Zhao}, title = {On the [1, 2]-domination number of generalized Petersen graphs}, journal = {Appl. Math. Comput.}, volume = {327}, pages = {1--7}, year = {2018}, url = {https://doi.org/10.1016/j.amc.2018.01.013}, doi = {10.1016/J.AMC.2018.01.013}, timestamp = {Fri, 21 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/amc/ChenMSZ18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/LiWMM18, author = {Hengzhe Li and Baoyindureng Wu and Jixiang Meng and Yingbin Ma}, title = {Steiner tree packing number and tree connectivity}, journal = {Discret. Math.}, volume = {341}, number = {7}, pages = {1945--1951}, year = {2018}, url = {https://doi.org/10.1016/j.disc.2018.03.021}, doi = {10.1016/J.DISC.2018.03.021}, timestamp = {Sat, 22 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/LiWMM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sigpro/LiMF18, author = {Haifeng Li and Yingbin Ma and Yuli Fu}, title = {An improved RIP-based performance guarantee for sparse signal recovery via simultaneous orthogonal matching pursuit}, journal = {Signal Process.}, volume = {144}, pages = {29--35}, year = {2018}, url = {https://doi.org/10.1016/j.sigpro.2017.09.027}, doi = {10.1016/J.SIGPRO.2017.09.027}, timestamp = {Sat, 22 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/sigpro/LiMF18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/amc/LiMYW17, author = {Hengzhe Li and Yingbin Ma and Weihua Yang and Yifei Wang}, title = {The generalized 3-connectivity of graph products}, journal = {Appl. Math. Comput.}, volume = {295}, pages = {77--83}, year = {2017}, url = {https://doi.org/10.1016/j.amc.2016.10.002}, doi = {10.1016/J.AMC.2016.10.002}, timestamp = {Fri, 21 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/amc/LiMYW17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/amc/MaL17, author = {Yingbin Ma and Zaiping Lu}, title = {Rainbow connection numbers of Cayley digraphs on abelian groups}, journal = {Appl. Math. Comput.}, volume = {311}, pages = {178--183}, year = {2017}, url = {https://doi.org/10.1016/j.amc.2017.05.024}, doi = {10.1016/J.AMC.2017.05.024}, timestamp = {Fri, 21 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/amc/MaL17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/arscom/CaiMS17, author = {Qingqiong Cai and Yingbin Ma and Jiangli Song}, title = {Rainbow connection numbers of ladders and Mobius ladders}, journal = {Ars Comb.}, volume = {131}, pages = {321--330}, year = {2017}, timestamp = {Tue, 07 Feb 2017 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/arscom/CaiMS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/LiM17, author = {Hengzhe Li and Yingbin Ma}, title = {Rainbow connection number and graph operations}, journal = {Discret. Appl. Math.}, volume = {230}, pages = {91--99}, year = {2017}, url = {https://doi.org/10.1016/j.dam.2017.06.004}, doi = {10.1016/J.DAM.2017.06.004}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/LiM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/MaL17, author = {Yingbin Ma and Zaiping Lu}, title = {Rainbow connection numbers of Cayley graphs}, journal = {J. Comb. Optim.}, volume = {34}, number = {1}, pages = {182--193}, year = {2017}, url = {https://doi.org/10.1007/s10878-016-0052-6}, doi = {10.1007/S10878-016-0052-6}, timestamp = {Tue, 13 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/MaL17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dmgt/ChenHM16, author = {Lily Chen and Bofeng Huo and Yingbin Ma}, title = {Hardness results for total rainbow connection of graphs}, journal = {Discuss. Math. Graph Theory}, volume = {36}, number = {2}, pages = {355--362}, year = {2016}, url = {https://doi.org/10.7151/dmgt.1856}, doi = {10.7151/DMGT.1856}, timestamp = {Mon, 08 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dmgt/ChenHM16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/LuM15, author = {Zaiping Lu and Yingbin Ma}, title = {Rainbow 2-Connection Numbers of Cayley Graphs}, journal = {Inf. Process. Lett.}, volume = {115}, number = {4}, pages = {486--491}, year = {2015}, url = {https://doi.org/10.1016/j.ipl.2014.12.007}, doi = {10.1016/J.IPL.2014.12.007}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/LuM15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/int/LiuLML12, author = {Wen An Liu and Haifeng Li and Yingbin Ma and Bei Li}, title = {On Supplements of 2 x m Board in Toppling Towers}, journal = {Integers}, volume = {12}, pages = {G4}, year = {2012}, url = {http://math.colgate.edu/\%7Eintegers/mg4/mg4.Abstract.html}, timestamp = {Fri, 27 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/int/LiuLML12.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.