Yuqing Lin

From MaRDI portal
Person:519217

Available identifiers

zbMath Open lin.yuqingMaRDI QIDQ519217

List of research outcomes





PublicationDate of PublicationType
4-Free Strong Digraphs with the Maximum Size2023-08-26Paper
https://portal.mardi4nfdi.de/entity/Q58718322023-01-25Paper
https://portal.mardi4nfdi.de/entity/Q50905292022-07-20Paper
Sufficient conditions for a graph to have all \([a, b]\)-factors and \((a, b)\)-parity factors2022-06-20Paper
A survey on enhanced power graphs of finite groups2022-06-14Paper
The super-connectivity of Kneser graph KG(n,3)2022-05-31Paper
https://portal.mardi4nfdi.de/entity/Q51651892021-11-15Paper
Some properties of the multiset dimension of graphs2021-09-06Paper
The number of circles of a maximum state of a plane graph with applications2021-05-11Paper
https://portal.mardi4nfdi.de/entity/Q49860302021-04-26Paper
https://portal.mardi4nfdi.de/entity/Q58588822021-04-14Paper
https://portal.mardi4nfdi.de/entity/Q51437072021-01-14Paper
https://portal.mardi4nfdi.de/entity/Q51277172020-10-27Paper
The 1-good-neighbor connectivity and diagnosability of Cayley graphs generated by complete graphs2018-06-27Paper
https://portal.mardi4nfdi.de/entity/Q53742312018-04-10Paper
The connectivity and nature diagnosability of expandedk-aryn-cubes2018-01-10Paper
https://portal.mardi4nfdi.de/entity/Q45956612017-12-06Paper
https://portal.mardi4nfdi.de/entity/Q45956602017-12-06Paper
https://portal.mardi4nfdi.de/entity/Q45956682017-12-06Paper
https://portal.mardi4nfdi.de/entity/Q53718262017-10-20Paper
On the anti-forcing number of fullerene graphs2017-07-19Paper
A linear algorithm for a perfect matching in polyomino graphs2017-05-12Paper
A note on the strong edge-coloring of outerplanar graphs with maximum degree 32017-04-04Paper
On the number of disjoint perfect matchings of regular graphs with given edge connectivity2016-12-22Paper
https://portal.mardi4nfdi.de/entity/Q29914152016-08-10Paper
The 2-good-neighbor diagnosability of Cayley graphs generated by transposition trees under the PMC model and MM\(^\ast\) model2016-04-13Paper
On edge connectivity and parity factor2015-07-08Paper
Maximum spectral radius of graphs with given connectivity, minimum degree and independence number2015-03-24Paper
Note on parity factors of regular graphs2015-03-05Paper
The maximum forcing number of polyomino2014-10-02Paper
Maximum Spectral Radius of Graphs with Connectivity at Most k and Minimum Degree at Least δ2014-01-17Paper
On extremal graphs with bounded girth2013-10-10Paper
On superconnectivity of (\(4, g\))-cages2013-02-25Paper
https://portal.mardi4nfdi.de/entity/Q31055262012-01-05Paper
https://portal.mardi4nfdi.de/entity/Q31042562011-12-19Paper
New improvements on connectivity of cages2011-06-24Paper
New results on EX graphs2011-02-19Paper
Note on super antimagicness of disconnected graphs2011-02-08Paper
A note on even disjoint union of paths2011-02-08Paper
https://portal.mardi4nfdi.de/entity/Q30590172010-12-08Paper
On superconnectivity of (4,g)-cages with even girth2010-11-24Paper
Strong labelings of linear forests2010-02-26Paper
Super-vertex-antimagic total labelings of disconnected graphs2009-12-15Paper
Superconnectivity of regular graphs with small diameter2009-06-30Paper
Calculating the extremal number \(ex(v;\{C_3,C_4,\dots,C_n\})\)2009-06-24Paper
On the number of components of \((k,g)\)-cages after vertex deletion2009-06-24Paper
https://portal.mardi4nfdi.de/entity/Q36261722009-05-22Paper
Diameter-sufficient conditions for a graph to be super-restricted connected2009-03-09Paper
https://portal.mardi4nfdi.de/entity/Q36061212009-02-26Paper
https://portal.mardi4nfdi.de/entity/Q35386472008-11-24Paper
HSAGA and its application for the construction of near-Moore digraphs2008-11-18Paper
On the connectivity of \((k,g)\)-cages of even girth2008-07-11Paper
https://portal.mardi4nfdi.de/entity/Q35018732008-06-03Paper
https://portal.mardi4nfdi.de/entity/Q54421652008-02-22Paper
https://portal.mardi4nfdi.de/entity/Q35951042007-08-10Paper
A lower bound on the order of regular graphs with given girth pair2007-06-11Paper
Calculating the extremal number2007-05-29Paper
Edge-antimagic graphs2007-04-26Paper
https://portal.mardi4nfdi.de/entity/Q34286852007-03-29Paper
https://portal.mardi4nfdi.de/entity/Q34219582007-02-08Paper
https://portal.mardi4nfdi.de/entity/Q54925972006-10-16Paper
https://portal.mardi4nfdi.de/entity/Q54882782006-09-14Paper
All (k;g)‐cages are edge‐superconnected2006-05-16Paper
https://portal.mardi4nfdi.de/entity/Q33670722006-01-23Paper
Improved lower bound for the vertex connectivity of \((\delta ;g)\)-cages2005-10-10Paper
https://portal.mardi4nfdi.de/entity/Q54634802005-08-04Paper
All (k;g)-cages arek-edge-connected2005-04-21Paper
https://portal.mardi4nfdi.de/entity/Q45344812003-04-02Paper
New constructions of magic and antimagic graph labelings2003-03-06Paper
https://portal.mardi4nfdi.de/entity/Q44439422003-01-01Paper
https://portal.mardi4nfdi.de/entity/Q31472692002-12-11Paper
Vertex magic total labellings of complete graphs2002-10-13Paper
On two conjectures concerning \((a,d)\)-antimagic labellings of antiprisms2002-07-02Paper
On the gracefulness of graph \(P_n^3\)2002-02-21Paper
A note on the path graph \(P_k(G)\)2001-06-20Paper
The graceful codes of graphs \(P_ n^ 3\).2001-06-20Paper
https://portal.mardi4nfdi.de/entity/Q42330191999-05-18Paper

Research outcomes over time

This page was built for person: Yuqing Lin