Publication | Date of Publication | Type |
---|
Monitoring the edges of a graph using distances | 2022-08-04 | Paper |
Monitoring the edges of a graph using distances | 2020-07-21 | Paper |
Improved Bound for Dilation of an Embedding onto Circulant Networks | 2020-07-02 | Paper |
An algebraic approach to lifts of digraphs | 2019-10-09 | Paper |
Magic and Antimagic Graphs | 2019-08-13 | Paper |
On the existence of radial Moore graphs for every radius and every degree | 2018-12-06 | Paper |
On digraphs of excess one | 2018-02-22 | Paper |
Characterisation of graphs with exclusive sum labelling | 2018-01-04 | Paper |
From expanded digraphs to lifts of voltage digraphs and line digraphs | 2017-12-06 | Paper |
https://portal.mardi4nfdi.de/entity/Q4595663 | 2017-12-06 | Paper |
https://portal.mardi4nfdi.de/entity/Q4595666 | 2017-12-06 | Paper |
https://portal.mardi4nfdi.de/entity/Q4595226 | 2017-11-29 | Paper |
https://portal.mardi4nfdi.de/entity/Q5354544 | 2017-09-04 | Paper |
A note on the locating-total domination in graphs | 2017-07-17 | Paper |
ON -ANTIMAGICNESS OF DISCONNECTED GRAPHS | 2017-05-16 | Paper |
Approximate results for rainbow labelings | 2017-04-25 | Paper |
A construction of dense mixed graphs of diameter 2 | 2017-02-13 | Paper |
A family of mixed graphs with large order and diameter 2 | 2016-12-28 | Paper |
Wheels are cycle-antimagic | 2016-10-17 | Paper |
Minimum weight resolving sets of grid graphs | 2016-09-16 | Paper |
On the metric dimension of circulant and Harary graphs | 2016-06-20 | Paper |
Maximum \(h\)-colourable subgraph problem in balanced graphs | 2016-06-09 | Paper |
Trends in Temporal Reasoning: Constraints, Graphs and Posets | 2016-05-25 | Paper |
Rees semigroups of digraphs for classification of data. | 2016-05-18 | Paper |
A revised Moore bound for mixed graphs | 2016-05-18 | Paper |
Maximum incomplete recursive circulants in graph embeddings | 2016-02-22 | Paper |
https://portal.mardi4nfdi.de/entity/Q3452051 | 2015-11-18 | Paper |
https://portal.mardi4nfdi.de/entity/Q2948821 | 2015-10-06 | Paper |
ON CYCLE-SUPERMAGICNESS OF SUBDIVIDED GRAPHS | 2015-08-14 | Paper |
Distances of centroid sets in a graph-based construction for information security applications | 2015-08-03 | Paper |
On the nonexistence of almost Moore digraphs of degree four and five | 2015-08-03 | Paper |
https://portal.mardi4nfdi.de/entity/Q5245528 | 2015-04-09 | Paper |
Antimagicness of generalized corona and snowflake graphs | 2015-03-25 | Paper |
Bipartite Ramsey numbers involving stars, stripes and trees | 2015-03-05 | Paper |
Antimagicness for a family of generalized antiprism graphs | 2015-03-05 | Paper |
Triangle randomization for social network data anonymization | 2015-01-26 | Paper |
Degree diameter problem on honeycomb networks | 2014-12-03 | Paper |
https://portal.mardi4nfdi.de/entity/Q2875897 | 2014-08-12 | Paper |
https://portal.mardi4nfdi.de/entity/Q4981203 | 2014-06-24 | Paper |
INCIDENCE SEMIRINGS OF GRAPHS AND VISIBLE BASES | 2014-06-06 | Paper |
Degree/diameter problem for trees and pseudotrees | 2014-04-25 | Paper |
On the partition dimension of a class of circulant graphs | 2014-04-17 | Paper |
Sparse graphs with vertex antimagic edge labelings | 2014-04-07 | Paper |
On the nonexistence of almost Moore digraphs | 2014-03-31 | Paper |
Antimagic labeling of generalized pyramid graphs | 2014-03-18 | Paper |
Construction Techniques for Digraphs with Minimum Diameter | 2014-01-17 | Paper |
An Application of Completely Separating Systems to Graph Labeling | 2014-01-17 | Paper |
Distance-locally disconnected graphs | 2013-12-13 | Paper |
Large vertex-transitive graphs of diameter 2 from incidence graphs of biaffine planes | 2013-12-06 | Paper |
https://portal.mardi4nfdi.de/entity/Q2857416 | 2013-11-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q2857421 | 2013-11-01 | Paper |
On Extremal Graphs with Bounded Girth | 2013-10-10 | Paper |
Stability of Hereditary Graph Classes Under Closure Operations | 2013-10-09 | Paper |
https://portal.mardi4nfdi.de/entity/Q2848745 | 2013-09-26 | Paper |
A Heuristic for Magic and Antimagic Graph Labellings | 2013-05-08 | Paper |
On large bipartite graphs of diameter 3 | 2013-03-01 | Paper |
Construction of antimagic labeling for the Cartesian product of regular graphs | 2012-12-03 | Paper |
https://portal.mardi4nfdi.de/entity/Q2918538 | 2012-10-08 | Paper |
https://portal.mardi4nfdi.de/entity/Q2906855 | 2012-09-05 | Paper |
PARALLEL ALGORITHMS FOR MAPPING SHORT DEGENERATE AND WEIGHTED DNA SEQUENCES TO A REFERENCE GENOME | 2012-08-30 | Paper |
The maximum degree and diameter-bounded subgraph in the mesh | 2012-08-14 | Paper |
Construction for antimagic generalized web graphs | 2012-01-26 | Paper |
https://portal.mardi4nfdi.de/entity/Q3105557 | 2012-01-05 | Paper |
Small vertex-transitive and Cayley graphs of girth six and given degree: an algebraic approach | 2011-12-20 | Paper |
https://portal.mardi4nfdi.de/entity/Q3104256 | 2011-12-19 | Paper |
https://portal.mardi4nfdi.de/entity/Q3101010 | 2011-11-22 | Paper |
On graphs of defect at most 2 | 2011-08-10 | Paper |
Structural properties of graphs of diameter 2 and defect 2 | 2011-07-04 | Paper |
Nonexistence of graphs with cyclic defect | 2011-06-01 | Paper |
On a Relationship between Completely Separating Systems and Antimagic Labeling of Regular Graphs | 2011-05-19 | Paper |
On Antimagic Labeling for Generalized Web and Flower Graphs | 2011-05-19 | Paper |
Super \(d\)-antimagic labelings of disconnected plane graphs | 2011-03-02 | Paper |
New results on EX graphs | 2011-02-19 | Paper |
Some open problems on graph labelings | 2011-02-08 | Paper |
New largest known graphs of diameter 6 | 2010-11-24 | Paper |
https://portal.mardi4nfdi.de/entity/Q3565908 | 2010-06-07 | Paper |
https://portal.mardi4nfdi.de/entity/Q3565909 | 2010-06-07 | Paper |
https://portal.mardi4nfdi.de/entity/Q3561438 | 2010-05-25 | Paper |
Complete catalogue of graphs of maximum degree 3 and defect at most 4 | 2010-04-28 | Paper |
On super \((a,d)\)-edge-antimagic total labeling of disconnected graphs | 2009-12-15 | Paper |
https://portal.mardi4nfdi.de/entity/Q3636203 | 2009-06-30 | Paper |
Calculating the extremal number \(ex(v;\{C_3,C_4,\dots,C_n\})\) | 2009-06-24 | Paper |
On the number of components of \((k,g)\)-cages after vertex deletion | 2009-06-24 | Paper |
Diameter-sufficient conditions for a graph to be super-restricted connected | 2009-03-09 | Paper |
https://portal.mardi4nfdi.de/entity/Q3606121 | 2009-02-26 | Paper |
Moore bound for mixed networks | 2009-01-28 | Paper |
https://portal.mardi4nfdi.de/entity/Q5503341 | 2009-01-15 | Paper |
On consecutive edge magic total labeling of graphs | 2008-11-18 | Paper |
HSAGA and its application for the construction of near-Moore digraphs | 2008-11-18 | Paper |
https://portal.mardi4nfdi.de/entity/Q3534279 | 2008-11-03 | Paper |
https://portal.mardi4nfdi.de/entity/Q3517231 | 2008-08-12 | Paper |
https://portal.mardi4nfdi.de/entity/Q3517232 | 2008-08-12 | Paper |
https://portal.mardi4nfdi.de/entity/Q3517234 | 2008-08-12 | Paper |
https://portal.mardi4nfdi.de/entity/Q3517247 | 2008-08-12 | Paper |
On the connectivity of \((k,g)\)-cages of even girth | 2008-07-11 | Paper |
Graphs of order two less than the Moore bound | 2008-05-29 | Paper |
Structural properties of graphs of diameter 2 with maximal repeats | 2008-04-28 | Paper |
https://portal.mardi4nfdi.de/entity/Q5446025 | 2008-03-06 | Paper |
Further results on sequetially additive graphs | 2008-02-22 | Paper |
Enumerations of vertex orders of almost Moore digraphs with selfrepeats | 2007-12-12 | Paper |
https://portal.mardi4nfdi.de/entity/Q3595104 | 2007-08-10 | Paper |
https://portal.mardi4nfdi.de/entity/Q5295615 | 2007-07-30 | Paper |
A lower bound on the order of regular graphs with given girth pair | 2007-06-11 | Paper |
New Largest Graphs of Diameter 6 | 2007-05-29 | Paper |
Divisibility conditions in almost Moore digraphs with selfrepeats | 2007-05-29 | Paper |
Calculating the extremal number | 2007-05-29 | Paper |
Edge-antimagic graphs | 2007-04-26 | Paper |
On irregular total labellings | 2007-04-26 | Paper |
https://portal.mardi4nfdi.de/entity/Q3369010 | 2007-03-22 | Paper |
On mixed Moore graphs | 2007-03-02 | Paper |
https://portal.mardi4nfdi.de/entity/Q3421946 | 2007-02-08 | Paper |
https://portal.mardi4nfdi.de/entity/Q3421958 | 2007-02-08 | Paper |
Multipartite Moore digraphs | 2006-12-07 | Paper |
https://portal.mardi4nfdi.de/entity/Q5492597 | 2006-10-16 | Paper |
On optimum summable graphs | 2006-10-12 | Paper |
Combinatorial Geometry and Graph Theory | 2006-10-10 | Paper |
Combinatorial Geometry and Graph Theory | 2006-10-10 | Paper |
Combinatorial Geometry and Graph Theory | 2006-10-10 | Paper |
Combinatorial Geometry and Graph Theory | 2006-10-10 | Paper |
https://portal.mardi4nfdi.de/entity/Q5488276 | 2006-09-14 | Paper |
https://portal.mardi4nfdi.de/entity/Q5488278 | 2006-09-14 | Paper |
https://portal.mardi4nfdi.de/entity/Q5488281 | 2006-09-14 | Paper |
https://portal.mardi4nfdi.de/entity/Q5488285 | 2006-09-14 | Paper |
https://portal.mardi4nfdi.de/entity/Q5480694 | 2006-08-03 | Paper |
https://portal.mardi4nfdi.de/entity/Q5476470 | 2006-07-14 | Paper |
Two new families of large compound graphs | 2006-06-06 | Paper |
All (k;g)‐cages are edge‐superconnected | 2006-05-16 | Paper |
Characterization of eccentric digraphs | 2006-03-29 | Paper |
https://portal.mardi4nfdi.de/entity/Q3367072 | 2006-01-23 | Paper |
Moore graphs and beyond: a survey of the degree/diameter problem | 2006-01-16 | Paper |
https://portal.mardi4nfdi.de/entity/Q5710510 | 2005-12-02 | Paper |
https://portal.mardi4nfdi.de/entity/Q5708982 | 2005-11-21 | Paper |
https://portal.mardi4nfdi.de/entity/Q5703680 | 2005-11-08 | Paper |
Improved lower bound for the vertex connectivity of \((\delta ;g)\)-cages | 2005-10-10 | Paper |
https://portal.mardi4nfdi.de/entity/Q5463480 | 2005-08-04 | Paper |
https://portal.mardi4nfdi.de/entity/Q5463519 | 2005-08-04 | Paper |
https://portal.mardi4nfdi.de/entity/Q5461520 | 2005-07-26 | Paper |
https://portal.mardi4nfdi.de/entity/Q5461528 | 2005-07-26 | Paper |
Complete characterization of almost Moore digraphs of degree three | 2005-04-21 | Paper |
All (k;g)-cages arek-edge-connected | 2005-04-21 | Paper |
https://portal.mardi4nfdi.de/entity/Q4662355 | 2005-03-30 | Paper |
Eccentric digraphs | 2004-10-01 | Paper |
Vertex-antimagic total labelings of graphs | 2004-03-25 | Paper |
https://portal.mardi4nfdi.de/entity/Q4432951 | 2004-02-17 | Paper |
https://portal.mardi4nfdi.de/entity/Q4405931 | 2003-10-27 | Paper |
https://portal.mardi4nfdi.de/entity/Q4795895 | 2003-05-20 | Paper |
https://portal.mardi4nfdi.de/entity/Q4534481 | 2003-04-02 | Paper |
On Ramsey numbers for trees versus wheels of five or six vertices | 2003-03-27 | Paper |
On Range Query Usability Of Statistical Databases | 2003-03-24 | Paper |
https://portal.mardi4nfdi.de/entity/Q4798531 | 2003-03-19 | Paper |
https://portal.mardi4nfdi.de/entity/Q2770448 | 2003-03-06 | Paper |
Vertex-Magic Total Labelings Of Generalized Petersen Graphs | 2003-03-04 | Paper |
https://portal.mardi4nfdi.de/entity/Q4443942 | 2003-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3147269 | 2002-12-11 | Paper |
https://portal.mardi4nfdi.de/entity/Q2765169 | 2002-10-13 | Paper |
https://portal.mardi4nfdi.de/entity/Q4552212 | 2002-08-29 | Paper |
https://portal.mardi4nfdi.de/entity/Q4537240 | 2002-08-05 | Paper |
https://portal.mardi4nfdi.de/entity/Q2766828 | 2002-07-22 | Paper |
https://portal.mardi4nfdi.de/entity/Q2744394 | 2002-07-02 | Paper |
Bounds on the number of isolates in sum graph labeling | 2002-06-27 | Paper |
https://portal.mardi4nfdi.de/entity/Q2732625 | 2002-04-08 | Paper |
On the sum number of wheels | 2002-04-08 | Paper |
Survey of certain valuations of graphs | 2002-03-24 | Paper |
https://portal.mardi4nfdi.de/entity/Q2721337 | 2001-11-20 | Paper |
https://portal.mardi4nfdi.de/entity/Q4526637 | 2001-11-09 | Paper |
https://portal.mardi4nfdi.de/entity/Q4526633 | 2001-10-21 | Paper |
The train marshalling problem | 2001-06-21 | Paper |
Digraphs of degree two which miss the Moore bound by two | 2001-04-20 | Paper |
A characterization of strongly chordal graphs | 2000-11-02 | Paper |
Almost Moore digraphs are diregular | 2000-08-15 | Paper |
An Optimization Problem in Statistical Databases | 2000-07-20 | Paper |
Connected graphs which are not mod sum graphs | 2000-02-23 | Paper |
https://portal.mardi4nfdi.de/entity/Q4222093 | 2000-02-09 | Paper |
https://portal.mardi4nfdi.de/entity/Q4222070 | 2000-02-02 | Paper |
https://portal.mardi4nfdi.de/entity/Q4269447 | 1999-10-31 | Paper |
https://portal.mardi4nfdi.de/entity/Q4261810 | 1999-09-15 | Paper |
https://portal.mardi4nfdi.de/entity/Q4230855 | 1999-08-02 | Paper |
https://portal.mardi4nfdi.de/entity/Q4239593 | 1999-05-26 | Paper |
A note on large graphs of diameter two and given maximum degree | 1999-04-23 | Paper |
A combinatorial problem in database security | 1999-03-30 | Paper |
Flattening antichains with respect to the volume | 1999-02-02 | Paper |
https://portal.mardi4nfdi.de/entity/Q4379745 | 1998-08-31 | Paper |
https://portal.mardi4nfdi.de/entity/Q4393281 | 1998-08-10 | Paper |
On the structure of digraphs with order close to the Moore bound | 1998-08-02 | Paper |
https://portal.mardi4nfdi.de/entity/Q4351074 | 1998-03-12 | Paper |
A note on constructing large Cayley graphs of given degree and diameter by voltage assignments | 1998-02-18 | Paper |
Transversal partitioning in balanced hypergraphs | 1997-11-18 | Paper |
https://portal.mardi4nfdi.de/entity/Q4884997 | 1996-11-10 | Paper |
https://portal.mardi4nfdi.de/entity/Q4882476 | 1996-09-29 | Paper |
https://portal.mardi4nfdi.de/entity/Q4882548 | 1996-06-18 | Paper |
https://portal.mardi4nfdi.de/entity/Q4858166 | 1996-03-31 | Paper |
Digraphs of degree 3 and order close to the moore bound | 1996-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4853716 | 1995-11-02 | Paper |
https://portal.mardi4nfdi.de/entity/Q4847026 | 1995-09-10 | Paper |
https://portal.mardi4nfdi.de/entity/Q4309108 | 1994-10-12 | Paper |
https://portal.mardi4nfdi.de/entity/Q4304337 | 1994-09-12 | Paper |
https://portal.mardi4nfdi.de/entity/Q3136996 | 1993-11-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4017198 | 1993-01-16 | Paper |
Minimum Diameter of Diregular Digraphs of Degree 2 | 1988-01-01 | Paper |