Mirka Miller

From MaRDI portal
Person:189461

Available identifiers

zbMath Open miller.mirkaDBLPm/MirkaMillerWikidataQ87051793 ScholiaQ87051793MaRDI QIDQ189461

List of research outcomes





PublicationDate of PublicationType
Monitoring the edges of a graph using distances2022-08-04Paper
Monitoring the edges of a graph using distances2020-07-21Paper
Improved Bound for Dilation of an Embedding onto Circulant Networks2020-07-02Paper
An algebraic approach to lifts of digraphs2019-10-09Paper
Magic and Antimagic Graphs2019-08-13Paper
On the existence of radial Moore graphs for every radius and every degree2018-12-06Paper
On digraphs of excess one2018-02-22Paper
Characterisation of graphs with exclusive sum labelling2018-01-04Paper
https://portal.mardi4nfdi.de/entity/Q45956632017-12-06Paper
https://portal.mardi4nfdi.de/entity/Q45956662017-12-06Paper
From expanded digraphs to lifts of voltage digraphs and line digraphs2017-12-06Paper
https://portal.mardi4nfdi.de/entity/Q45952262017-11-29Paper
https://portal.mardi4nfdi.de/entity/Q53545442017-09-04Paper
A note on the locating-total domination in graphs2017-07-17Paper
ON -ANTIMAGICNESS OF DISCONNECTED GRAPHS2017-05-16Paper
Approximate results for rainbow labelings2017-04-25Paper
A construction of dense mixed graphs of diameter 22017-02-13Paper
A family of mixed graphs with large order and diameter 22016-12-28Paper
Wheels are cycle-antimagic2016-10-17Paper
Minimum weight resolving sets of grid graphs2016-09-16Paper
On the metric dimension of circulant and Harary graphs2016-06-20Paper
Maximum \(h\)-colourable subgraph problem in balanced graphs2016-06-09Paper
Trends in Temporal Reasoning: Constraints, Graphs and Posets2016-05-25Paper
Rees semigroups of digraphs for classification of data.2016-05-18Paper
A revised Moore bound for mixed graphs2016-05-18Paper
Maximum incomplete recursive circulants in graph embeddings2016-02-22Paper
https://portal.mardi4nfdi.de/entity/Q34520512015-11-18Paper
https://portal.mardi4nfdi.de/entity/Q29488212015-10-06Paper
ON CYCLE-SUPERMAGICNESS OF SUBDIVIDED GRAPHS2015-08-14Paper
On the nonexistence of almost Moore digraphs of degree four and five2015-08-03Paper
Distances of centroid sets in a graph-based construction for information security applications2015-08-03Paper
https://portal.mardi4nfdi.de/entity/Q52455282015-04-09Paper
Antimagicness of generalized corona and snowflake graphs2015-03-25Paper
Antimagicness for a family of generalized antiprism graphs2015-03-05Paper
Bipartite Ramsey numbers involving stars, stripes and trees2015-03-05Paper
Triangle randomization for social network data anonymization2015-01-26Paper
Degree diameter problem on honeycomb networks2014-12-03Paper
Maximizing the size of planar graphs under girth constraints2014-08-12Paper
https://portal.mardi4nfdi.de/entity/Q49812032014-06-24Paper
INCIDENCE SEMIRINGS OF GRAPHS AND VISIBLE BASES2014-06-06Paper
Degree/diameter problem for trees and pseudotrees2014-04-25Paper
On the partition dimension of a class of circulant graphs2014-04-17Paper
Sparse graphs with vertex antimagic edge labelings2014-04-07Paper
On the nonexistence of almost Moore digraphs2014-03-31Paper
Antimagic labeling of generalized pyramid graphs2014-03-18Paper
Construction Techniques for Digraphs with Minimum Diameter2014-01-17Paper
An Application of Completely Separating Systems to Graph Labeling2014-01-17Paper
Distance-locally disconnected graphs2013-12-13Paper
Large vertex-transitive graphs of diameter 2 from incidence graphs of biaffine planes2013-12-06Paper
All graphs have antimagic total labelings2013-11-01Paper
Extremal graphs without cycles of length 8 or less2013-11-01Paper
On extremal graphs with bounded girth2013-10-10Paper
Stability of hereditary graph classes under closure operations2013-10-09Paper
Construction of new larger \((a,d)\)-edge antimagic, vertex graphs by using adjacency matrices2013-09-26Paper
A Heuristic for Magic and Antimagic Graph Labellings2013-05-08Paper
On large bipartite graphs of diameter 32013-03-01Paper
Construction of antimagic labeling for the Cartesian product of regular graphs2012-12-03Paper
Super edge-antimagic total labelings of \(mK_{n,n,n}\).2012-10-08Paper
Antimagicness of some families of generalized graphs2012-09-05Paper
Parallel algorithms for mapping short degenerate and weighted DNA sequences to a reference genome2012-08-30Paper
The maximum degree and diameter-bounded subgraph in the mesh2012-08-14Paper
Construction for antimagic generalized web graphs2012-01-26Paper
https://portal.mardi4nfdi.de/entity/Q31055572012-01-05Paper
Small vertex-transitive and Cayley graphs of girth six and given degree: an algebraic approach2011-12-20Paper
https://portal.mardi4nfdi.de/entity/Q31042562011-12-19Paper
https://portal.mardi4nfdi.de/entity/Q31010102011-11-22Paper
On graphs of defect at most 22011-08-10Paper
Structural properties of graphs of diameter 2 and defect 22011-07-04Paper
Nonexistence of graphs with cyclic defect2011-06-01Paper
On Antimagic Labeling for Generalized Web and Flower Graphs2011-05-19Paper
On a Relationship between Completely Separating Systems and Antimagic Labeling of Regular Graphs2011-05-19Paper
Super \(d\)-antimagic labelings of disconnected plane graphs2011-03-02Paper
New results on EX graphs2011-02-19Paper
Some open problems on graph labelings2011-02-08Paper
New largest known graphs of diameter 62010-11-24Paper
https://portal.mardi4nfdi.de/entity/Q35659082010-06-07Paper
https://portal.mardi4nfdi.de/entity/Q35659092010-06-07Paper
https://portal.mardi4nfdi.de/entity/Q35614382010-05-25Paper
Complete catalogue of graphs of maximum degree 3 and defect at most 42010-04-28Paper
On super \((a,d)\)-edge-antimagic total labeling of disconnected graphs2009-12-15Paper
https://portal.mardi4nfdi.de/entity/Q36362032009-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
Diameter-sufficient conditions for a graph to be super-restricted connected2009-03-09Paper
https://portal.mardi4nfdi.de/entity/Q36061212009-02-26Paper
Moore bound for mixed networks2009-01-28Paper
https://portal.mardi4nfdi.de/entity/Q55033412009-01-15Paper
HSAGA and its application for the construction of near-Moore digraphs2008-11-18Paper
On consecutive edge magic total labeling of graphs2008-11-18Paper
https://portal.mardi4nfdi.de/entity/Q35342792008-11-03Paper
https://portal.mardi4nfdi.de/entity/Q35172312008-08-12Paper
https://portal.mardi4nfdi.de/entity/Q35172322008-08-12Paper
https://portal.mardi4nfdi.de/entity/Q35172472008-08-12Paper
https://portal.mardi4nfdi.de/entity/Q35172342008-08-12Paper
On the connectivity of \((k,g)\)-cages of even girth2008-07-11Paper
Graphs of order two less than the Moore bound2008-05-29Paper
Structural properties of graphs of diameter 2 with maximal repeats2008-04-28Paper
https://portal.mardi4nfdi.de/entity/Q54460252008-03-06Paper
Further results on sequetially additive graphs2008-02-22Paper
Enumerations of vertex orders of almost Moore digraphs with selfrepeats2007-12-12Paper
https://portal.mardi4nfdi.de/entity/Q35951042007-08-10Paper
https://portal.mardi4nfdi.de/entity/Q52956152007-07-30Paper
A lower bound on the order of regular graphs with given girth pair2007-06-11Paper
Divisibility conditions in almost Moore digraphs with selfrepeats2007-05-29Paper
New Largest Graphs of Diameter 62007-05-29Paper
Calculating the extremal number2007-05-29Paper
On irregular total labellings2007-04-26Paper
Edge-antimagic graphs2007-04-26Paper
https://portal.mardi4nfdi.de/entity/Q33690102007-03-22Paper
On mixed Moore graphs2007-03-02Paper
https://portal.mardi4nfdi.de/entity/Q34219582007-02-08Paper
https://portal.mardi4nfdi.de/entity/Q34219462007-02-08Paper
Multipartite Moore digraphs2006-12-07Paper
https://portal.mardi4nfdi.de/entity/Q54925972006-10-16Paper
On optimum summable graphs2006-10-12Paper
Combinatorial Geometry and Graph Theory2006-10-10Paper
Combinatorial Geometry and Graph Theory2006-10-10Paper
Combinatorial Geometry and Graph Theory2006-10-10Paper
Combinatorial Geometry and Graph Theory2006-10-10Paper
https://portal.mardi4nfdi.de/entity/Q54882782006-09-14Paper
https://portal.mardi4nfdi.de/entity/Q54882852006-09-14Paper
https://portal.mardi4nfdi.de/entity/Q54882812006-09-14Paper
https://portal.mardi4nfdi.de/entity/Q54882762006-09-14Paper
https://portal.mardi4nfdi.de/entity/Q54806942006-08-03Paper
https://portal.mardi4nfdi.de/entity/Q54764702006-07-14Paper
Two new families of large compound graphs2006-06-06Paper
All (k;g)‐cages are edge‐superconnected2006-05-16Paper
Characterization of eccentric digraphs2006-03-29Paper
https://portal.mardi4nfdi.de/entity/Q33670722006-01-23Paper
Moore graphs and beyond: a survey of the degree/diameter problem2006-01-16Paper
https://portal.mardi4nfdi.de/entity/Q57105102005-12-02Paper
https://portal.mardi4nfdi.de/entity/Q57089822005-11-21Paper
https://portal.mardi4nfdi.de/entity/Q57036802005-11-08Paper
Improved lower bound for the vertex connectivity of \((\delta ;g)\)-cages2005-10-10Paper
https://portal.mardi4nfdi.de/entity/Q54635192005-08-04Paper
https://portal.mardi4nfdi.de/entity/Q54634802005-08-04Paper
https://portal.mardi4nfdi.de/entity/Q54615282005-07-26Paper
https://portal.mardi4nfdi.de/entity/Q54615202005-07-26Paper
All (k;g)-cages arek-edge-connected2005-04-21Paper
Complete characterization of almost Moore digraphs of degree three2005-04-21Paper
https://portal.mardi4nfdi.de/entity/Q46623552005-03-30Paper
Eccentric digraphs2004-10-01Paper
Vertex-antimagic total labelings of graphs2004-03-25Paper
https://portal.mardi4nfdi.de/entity/Q44329512004-02-17Paper
https://portal.mardi4nfdi.de/entity/Q44059312003-10-27Paper
https://portal.mardi4nfdi.de/entity/Q47958952003-05-20Paper
https://portal.mardi4nfdi.de/entity/Q45344812003-04-02Paper
On Ramsey numbers for trees versus wheels of five or six vertices2003-03-27Paper
On Range Query Usability Of Statistical Databases2003-03-24Paper
https://portal.mardi4nfdi.de/entity/Q47985312003-03-19Paper
New constructions of magic and antimagic graph labelings2003-03-06Paper
Vertex-Magic Total Labelings Of Generalized Petersen Graphs2003-03-04Paper
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
https://portal.mardi4nfdi.de/entity/Q45522122002-08-29Paper
https://portal.mardi4nfdi.de/entity/Q45372402002-08-05Paper
https://portal.mardi4nfdi.de/entity/Q27668282002-07-22Paper
On two conjectures concerning \((a,d)\)-antimagic labellings of antiprisms2002-07-02Paper
Bounds on the number of isolates in sum graph labeling2002-06-27Paper
On the sum number of wheels2002-04-08Paper
On two conjectures concerning vertex-magic total labelings of generalized Petersen graphs2002-04-08Paper
Survey of certain valuations of graphs2002-03-24Paper
Antimagic face labeling of convex polytopes based on biprisms2001-11-20Paper
https://portal.mardi4nfdi.de/entity/Q45266372001-11-09Paper
https://portal.mardi4nfdi.de/entity/Q45266332001-10-21Paper
The train marshalling problem2001-06-21Paper
Digraphs of degree two which miss the Moore bound by two2001-04-20Paper
A characterization of strongly chordal graphs2000-11-02Paper
Almost Moore digraphs are diregular2000-08-15Paper
An Optimization Problem in Statistical Databases2000-07-20Paper
Connected graphs which are not mod sum graphs2000-02-23Paper
https://portal.mardi4nfdi.de/entity/Q42220932000-02-09Paper
https://portal.mardi4nfdi.de/entity/Q42220702000-02-02Paper
https://portal.mardi4nfdi.de/entity/Q42694471999-10-31Paper
https://portal.mardi4nfdi.de/entity/Q42618101999-09-15Paper
https://portal.mardi4nfdi.de/entity/Q42308551999-08-02Paper
https://portal.mardi4nfdi.de/entity/Q42395931999-05-26Paper
A note on large graphs of diameter two and given maximum degree1999-04-23Paper
A combinatorial problem in database security1999-03-30Paper
Flattening antichains with respect to the volume1999-02-02Paper
https://portal.mardi4nfdi.de/entity/Q43797451998-08-31Paper
https://portal.mardi4nfdi.de/entity/Q43932811998-08-10Paper
On the structure of digraphs with order close to the Moore bound1998-08-02Paper
https://portal.mardi4nfdi.de/entity/Q43510741998-03-12Paper
A note on constructing large Cayley graphs of given degree and diameter by voltage assignments1998-02-18Paper
Transversal partitioning in balanced hypergraphs1997-11-18Paper
https://portal.mardi4nfdi.de/entity/Q48849971996-11-10Paper
https://portal.mardi4nfdi.de/entity/Q48824761996-09-29Paper
https://portal.mardi4nfdi.de/entity/Q48825481996-06-18Paper
https://portal.mardi4nfdi.de/entity/Q48581661996-03-31Paper
Digraphs of degree 3 and order close to the moore bound1996-01-01Paper
https://portal.mardi4nfdi.de/entity/Q48537161995-11-02Paper
https://portal.mardi4nfdi.de/entity/Q48470261995-09-10Paper
https://portal.mardi4nfdi.de/entity/Q43091081994-10-12Paper
https://portal.mardi4nfdi.de/entity/Q43043371994-09-12Paper
https://portal.mardi4nfdi.de/entity/Q31369961993-11-01Paper
https://portal.mardi4nfdi.de/entity/Q40171981993-01-16Paper
Minimum Diameter of Diregular Digraphs of Degree 21988-01-01Paper

Research outcomes over time

This page was built for person: Mirka Miller