Bing Yao

From MaRDI portal
Person:264188

Available identifiers

zbMath Open yao.bingMaRDI QIDQ264188

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q61882372024-02-07Paper
Various matching keys for asymmetric topology encryption2023-12-22Paper
Graphic lattices made by graph felicitous-type labelings and colorings of topological coding2023-06-05Paper
Eigenvalues of transition weight matrix for a family of weighted networks2023-01-17Paper
Generating Fibonacci-model as evolution of networks with vertex-velocity and time-memory2022-08-05Paper
A class of vertex-edge-growth small-world network models having scale-free, self-similar and hierarchical characters2022-06-23Paper
A family of small-world network models built by complete graph and iteration-function2022-06-23Paper
The relations between network-operation and topological-property in a scale-free and small-world network with community structure2022-06-20Paper
A new vertex distinguishing total coloring of trees2022-06-03Paper
Two cumulative distributions for scale-freeness of dynamic networks2022-05-20Paper
On elegant labelling and magic labelling of large-scale graphs2022-05-09Paper
New Techniques Based On Odd-Edge Total Colorings In Topological Cryptosystem2022-05-05Paper
https://portal.mardi4nfdi.de/entity/Q50715552022-04-22Paper
https://portal.mardi4nfdi.de/entity/Q50628892022-03-17Paper
Random walks on Fibonacci treelike models2022-03-01Paper
https://portal.mardi4nfdi.de/entity/Q50331712022-02-22Paper
An extension on neighbor sum distinguishing total coloring of graphs2022-01-08Paper
A note on 1-2-3 and 1-2 Conjectures for 3-regular graphs2021-07-01Paper
Recent Colorings And Labelings In Topological Coding2021-06-29Paper
https://portal.mardi4nfdi.de/entity/Q33857532021-01-14Paper
Topological graph passwords based on the gracefulness of disconnected graphs with circles2020-10-27Paper
https://portal.mardi4nfdi.de/entity/Q33066012020-08-12Paper
https://portal.mardi4nfdi.de/entity/Q33077052020-08-12Paper
Graphic Lattices and Matrix Lattices Of Topological Coding2020-05-08Paper
Ice-Flower Systems And Star-graphic Lattices2020-05-06Paper
Graph Homomorphisms Based On Particular Total Colorings of Graphs and Graphic Lattices2020-05-05Paper
An extremal problem: How small scale-free graph can be2019-11-20Paper
Using Chinese Characters To Generate Text-Based Passwords For Information Security2019-07-11Paper
https://portal.mardi4nfdi.de/entity/Q53816342019-06-21Paper
https://portal.mardi4nfdi.de/entity/Q53816612019-06-21Paper
https://portal.mardi4nfdi.de/entity/Q53818332019-06-21Paper
https://portal.mardi4nfdi.de/entity/Q46236082019-02-22Paper
https://portal.mardi4nfdi.de/entity/Q46240442019-02-22Paper
https://portal.mardi4nfdi.de/entity/Q46137152019-01-25Paper
Edge-magic even-gracefulness of several kinds of spread network models2018-10-22Paper
Exploring equivalent definitions of eulerian graphs2018-10-22Paper
https://portal.mardi4nfdi.de/entity/Q46833052018-09-20Paper
Text-based Passwords Generated From Topological Graphic Passwords2018-09-12Paper
https://portal.mardi4nfdi.de/entity/Q31753292018-07-18Paper
https://portal.mardi4nfdi.de/entity/Q31753382018-07-18Paper
https://portal.mardi4nfdi.de/entity/Q45744002018-07-18Paper
https://portal.mardi4nfdi.de/entity/Q45748372018-07-18Paper
https://portal.mardi4nfdi.de/entity/Q45748422018-07-18Paper
https://portal.mardi4nfdi.de/entity/Q45748452018-07-18Paper
One scale-free network model based on two different preferential attachment probabilities2018-07-18Paper
The number of spanning trees of a class of self-similar fractal models2018-05-25Paper
https://portal.mardi4nfdi.de/entity/Q46413332018-05-25Paper
https://portal.mardi4nfdi.de/entity/Q46429242018-05-25Paper
https://portal.mardi4nfdi.de/entity/Q46429342018-05-25Paper
https://portal.mardi4nfdi.de/entity/Q31316602018-01-29Paper
https://portal.mardi4nfdi.de/entity/Q31318152018-01-29Paper
https://portal.mardi4nfdi.de/entity/Q31322942018-01-29Paper
https://portal.mardi4nfdi.de/entity/Q31325682018-01-29Paper
An iteration method for computing the total number of spanning trees and its applications in graph theory2017-12-20Paper
https://portal.mardi4nfdi.de/entity/Q53676392017-10-20Paper
探索 2-边连通图的等价定义2017-10-20Paper
https://portal.mardi4nfdi.de/entity/Q53714902017-10-20Paper
https://portal.mardi4nfdi.de/entity/Q53716712017-10-20Paper
https://portal.mardi4nfdi.de/entity/Q52763752017-07-14Paper
https://portal.mardi4nfdi.de/entity/Q52769972017-07-14Paper
https://portal.mardi4nfdi.de/entity/Q52772802017-07-14Paper
一种证明(k,d)-强优美树的新方法2017-05-17Paper
https://portal.mardi4nfdi.de/entity/Q29873992017-05-17Paper
Relations of vertex distinguishing total chromatic numbers between a subgraph and its supergraph2017-02-08Paper
Generalized edge-magic total labellings of models from researching networks2017-01-31Paper
https://portal.mardi4nfdi.de/entity/Q31798762017-01-06Paper
https://portal.mardi4nfdi.de/entity/Q28288822016-10-26Paper
https://portal.mardi4nfdi.de/entity/Q28290392016-10-26Paper
Spanning trees of totally edge-growing network models2016-10-06Paper
https://portal.mardi4nfdi.de/entity/Q28242182016-10-06Paper
https://portal.mardi4nfdi.de/entity/Q28242892016-10-06Paper
https://portal.mardi4nfdi.de/entity/Q29905582016-08-10Paper
https://portal.mardi4nfdi.de/entity/Q29926542016-08-10Paper
A note on graph proper total colorings with many distinguishing constraints2016-04-06Paper
https://portal.mardi4nfdi.de/entity/Q34615502016-01-15Paper
https://portal.mardi4nfdi.de/entity/Q34628152016-01-15Paper
A Note On Vertex Distinguishing Edge colorings of Trees2016-01-08Paper
Improper Graceful and Odd-graceful Labellings of Graph Theory2015-12-29Paper
Probing Graph Proper Total Colorings With Additional Constrained Conditions2015-12-28Paper
https://portal.mardi4nfdi.de/entity/Q31933922015-10-28Paper
https://portal.mardi4nfdi.de/entity/Q31934122015-10-28Paper
https://portal.mardi4nfdi.de/entity/Q31939682015-10-28Paper
https://portal.mardi4nfdi.de/entity/Q31941302015-10-28Paper
https://portal.mardi4nfdi.de/entity/Q31942232015-10-28Paper
https://portal.mardi4nfdi.de/entity/Q31942842015-10-28Paper
https://portal.mardi4nfdi.de/entity/Q31957712015-10-28Paper
https://portal.mardi4nfdi.de/entity/Q52606172015-06-29Paper
https://portal.mardi4nfdi.de/entity/Q54981212015-02-11Paper
https://portal.mardi4nfdi.de/entity/Q29235092014-11-03Paper
https://portal.mardi4nfdi.de/entity/Q29238242014-11-03Paper
https://portal.mardi4nfdi.de/entity/Q29242772014-11-03Paper
https://portal.mardi4nfdi.de/entity/Q29242842014-11-03Paper
https://portal.mardi4nfdi.de/entity/Q29243082014-11-03Paper
https://portal.mardi4nfdi.de/entity/Q29247822014-11-03Paper
https://portal.mardi4nfdi.de/entity/Q29271962014-11-03Paper
https://portal.mardi4nfdi.de/entity/Q29273192014-11-03Paper
Vertex-distinguishing E-total colorings of graphs2014-10-07Paper
On defected colourings of graphs2014-03-14Paper
https://portal.mardi4nfdi.de/entity/Q54010682014-03-12Paper
https://portal.mardi4nfdi.de/entity/Q54010742014-03-12Paper
https://portal.mardi4nfdi.de/entity/Q53990162014-02-28Paper
https://portal.mardi4nfdi.de/entity/Q53999732014-02-28Paper
On equitable vertex distinguishing edge colorings of trees2014-02-28Paper
Not necessarily proper total colourings which are adjacent vertex distinguishing2014-01-29Paper
https://portal.mardi4nfdi.de/entity/Q28581962013-11-19Paper
https://portal.mardi4nfdi.de/entity/Q28582032013-11-19Paper
https://portal.mardi4nfdi.de/entity/Q28587612013-11-19Paper
https://portal.mardi4nfdi.de/entity/Q28604412013-11-19Paper
https://portal.mardi4nfdi.de/entity/Q28605412013-11-19Paper
Vertex-distinguishing IE-total colorings of complete bipartite graphs K_{m,n}(m<n)2013-11-11Paper
https://portal.mardi4nfdi.de/entity/Q49277832013-06-20Paper
https://portal.mardi4nfdi.de/entity/Q52996112013-06-20Paper
https://portal.mardi4nfdi.de/entity/Q49248942013-06-10Paper
Every lobster is odd-elegant2013-03-21Paper
https://portal.mardi4nfdi.de/entity/Q49009772013-01-24Paper
https://portal.mardi4nfdi.de/entity/Q49009782013-01-24Paper
https://portal.mardi4nfdi.de/entity/Q49010592013-01-24Paper
https://portal.mardi4nfdi.de/entity/Q49012712013-01-24Paper
https://portal.mardi4nfdi.de/entity/Q49015042013-01-24Paper
https://portal.mardi4nfdi.de/entity/Q48974632012-12-19Paper
https://portal.mardi4nfdi.de/entity/Q29182352012-10-05Paper
https://portal.mardi4nfdi.de/entity/Q28873222012-06-01Paper
https://portal.mardi4nfdi.de/entity/Q31180972012-03-01Paper
https://portal.mardi4nfdi.de/entity/Q31097252012-01-27Paper
On gracefulness of directed trees with short diameters2012-01-26Paper
https://portal.mardi4nfdi.de/entity/Q31703972011-09-29Paper
https://portal.mardi4nfdi.de/entity/Q30117572011-06-29Paper
https://portal.mardi4nfdi.de/entity/Q30702482011-02-02Paper
https://portal.mardi4nfdi.de/entity/Q30702722011-02-02Paper
https://portal.mardi4nfdi.de/entity/Q30702832011-02-02Paper
https://portal.mardi4nfdi.de/entity/Q30702862011-02-02Paper
Some results on spanning trees2010-10-29Paper
Adjacent strong edge colorings and total colorings of regular graphs2009-12-02Paper
https://portal.mardi4nfdi.de/entity/Q53228312009-07-22Paper
On the adjacent-vertex-strongly-distinguishing total coloring of graphs2008-06-25Paper
https://portal.mardi4nfdi.de/entity/Q54530822008-04-04Paper
https://portal.mardi4nfdi.de/entity/Q57545902007-08-23Paper
https://portal.mardi4nfdi.de/entity/Q57545922007-08-23Paper
https://portal.mardi4nfdi.de/entity/Q52958892007-07-31Paper
https://portal.mardi4nfdi.de/entity/Q52949762007-07-26Paper
\(D(\beta)\)-vertex-distinguishing total coloring of graphs2007-02-16Paper
Edge-face chromatic number of 2-connected plane graphs with high maximum degree2006-10-05Paper
https://portal.mardi4nfdi.de/entity/Q33668312006-02-16Paper
On adjacent-vertex-distinguishing total coloring of graphs2005-11-30Paper
https://portal.mardi4nfdi.de/entity/Q30249482005-07-04Paper
https://portal.mardi4nfdi.de/entity/Q44690152004-06-14Paper
On bandwidth sums of graphs1996-03-11Paper
On upper bounds of bandwidths of trees1996-02-26Paper
Maximum Bandwidth Under Edge Addition1995-08-13Paper
On Erdős's problem of bandwidth of graph adding edge1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33285861983-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Bing Yao