| Publication | Date of Publication | Type |
|---|
| Open-independent, open-locating-dominating sets | 2021-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5133074 | 2020-11-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4566243 | 2018-06-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4566227 | 2018-06-14 | Paper |
| Centroidal bases in graphs | 2018-05-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636188 | 2018-04-23 | Paper |
| It Is All Labeling | 2016-12-16 | Paper |
| Any tree with \(m\) edges can be embedded in a graceful tree with less than \(4m\) edges and in a graceful planar graph | 2016-12-14 | Paper |
| Embedding an arbitrary tree in a graceful tree | 2016-07-11 | Paper |
| On the efficiency index of a graph | 2016-04-13 | Paper |
| Graph sharing | 2016-04-13 | Paper |
| Fault tolerant detectors for distinguishing sets in graphs | 2015-11-17 | Paper |
| On open neighborhood locating-dominating in graphs | 2015-03-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2938248 | 2015-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3189115 | 2014-09-09 | Paper |
| OLD trees with maximum degree three | 2014-08-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5405490 | 2014-04-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5405452 | 2014-04-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5403279 | 2014-03-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5403282 | 2014-03-25 | Paper |
| Liar's domination in ladders | 2014-01-03 | Paper |
| Open neighborhood locating-domination for grid-like graphs | 2014-01-03 | Paper |
| Graphical parameters for classes of tumbling block graphs | 2014-01-03 | Paper |
| Uniqueness of vertex magic constants | 2013-09-26 | Paper |
| Local degree sequence bounds for graphical parameters | 2013-07-12 | Paper |
| An introduction to closed/open neighborhood sums: minimax, maximin, and spread | 2012-12-03 | Paper |
| On efficient dominating sets in simplicial graphs | 2012-09-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3110134 | 2012-01-26 | Paper |
| The graph distance game | 2011-12-01 | Paper |
| The connected hub number and the connected domination number | 2011-11-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3089231 | 2011-08-24 | Paper |
| Distance independence in graphs | 2011-08-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3012588 | 2011-07-06 | Paper |
| Open neighborhood locating-dominating in trees | 2011-03-10 | Paper |
| Minimax open and closed neighborhood sums | 2011-02-08 | Paper |
| On locating-domination in graphs | 2010-12-08 | Paper |
| Liar's domination | 2010-11-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3581950 | 2010-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3565861 | 2010-06-07 | Paper |
| Liar's domination in graphs | 2009-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3621535 | 2009-04-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3620648 | 2009-04-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3616664 | 2009-03-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3615799 | 2009-03-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5506519 | 2009-01-28 | Paper |
| Queen's domination using border squares and \((A,B)\)-restricted domination | 2008-09-04 | Paper |
| Efficient (j,k)-domination | 2008-06-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3507250 | 2008-06-18 | Paper |
| Competition parameters of a graph | 2008-03-06 | Paper |
| Colored problems in graphs | 2008-03-06 | Paper |
| Domination in discrete structures -- new directions | 2008-03-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5443219 | 2008-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5441572 | 2008-02-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5441580 | 2008-02-15 | Paper |
| Roman dominating influence parameters | 2007-12-06 | Paper |
| Efficient domination in knights graphs | 2007-06-25 | Paper |
| A survey on graphs which have equal domination and closed neighbourhood packing numbers | 2007-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3429583 | 2007-04-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3429551 | 2007-04-02 | Paper |
| The Central Limit Theorem and the Law of Large Numbers for Pair-Connectivity in Bernoulli Trees | 2007-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3413877 | 2006-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5492580 | 2006-10-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5488331 | 2006-09-14 | Paper |
| Competition-reachability of a graph | 2006-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3378214 | 2006-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3378268 | 2006-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5463504 | 2005-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4677981 | 2005-05-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4677970 | 2005-05-23 | Paper |
| \(H\)-domination in graphs | 2003-12-04 | Paper |
| Distance and connectivity measures in permutation graphs | 2003-09-25 | Paper |
| Graphs of order \(n\) with locating-chromatic number \(n-1\) | 2003-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4405784 | 2003-06-23 | Paper |
| \(H\)-forming sets in graphs | 2003-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4794375 | 2003-04-11 | Paper |
| Parity Dimension for Graphs - A Linear Algebraic Approach | 2003-03-17 | Paper |
| Strong equality of domination parameters in trees | 2003-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4443243 | 2003-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4532750 | 2002-10-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4329135 | 2002-10-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4552154 | 2002-08-29 | Paper |
| Average distance in colored graphs | 2002-08-28 | Paper |
| Paired-domination in graphs | 2002-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4529313 | 2002-06-24 | Paper |
| Fault-tolerant locating-dominating sets | 2002-05-28 | Paper |
| Strong equality of upper domination and independence in trees | 2001-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4949794 | 2001-10-03 | Paper |
| A generalization of domination critical graphs | 2001-07-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4504901 | 2001-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4489233 | 2000-12-11 | Paper |
| Parity dimension for graphs | 2000-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4934875 | 2000-10-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4504905 | 2000-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4487449 | 2000-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4943509 | 2000-05-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4949853 | 2000-05-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4943287 | 2000-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4943514 | 2000-03-16 | Paper |
| A survey of sequences of central subgraphs | 2000-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4243047 | 1999-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3842519 | 1999-05-04 | Paper |
| Parallel Knockouts in the Complete Graph | 1999-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3838202 | 1999-01-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4390693 | 1998-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3838207 | 1998-08-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4379748 | 1998-07-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4387707 | 1998-07-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4378622 | 1998-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4387716 | 1998-05-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4368728 | 1997-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4346236 | 1997-08-03 | Paper |
| Generalized domination and efficient domination in graphs | 1997-04-13 | Paper |
| Inequalities relating domination parameters in cubic graphs | 1997-03-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4367787 | 1997-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4882551 | 1996-11-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4871068 | 1996-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4874588 | 1996-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4871151 | 1996-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4863439 | 1996-07-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4873776 | 1996-04-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4873832 | 1996-04-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4873691 | 1996-04-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4858149 | 1996-02-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4834618 | 1995-11-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4304332 | 1995-09-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3139761 | 1994-12-04 | Paper |
| The expected number of pairs of connected nodes: Pair-connected reliability | 1994-12-04 | Paper |
| A recurrence template for several parameters in series-parallel graphs | 1994-11-03 | Paper |
| Efficient edge domination problems in graphs | 1994-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4304559 | 1994-09-12 | Paper |
| MAXIMUM INDEPENDENT, MINIMALLY REDUNDANT SETS IN SERIES-PARALLEL GRAPHS | 1994-04-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3139841 | 1993-11-11 | Paper |
| On uniformly optimally reliable graphs for pair‐connected reliability with vertex failures | 1993-09-05 | Paper |
| The optimal unicyclic graphs for pair-connected reliability | 1993-05-16 | Paper |
| Distinct distance sets in a graph | 1992-06-28 | Paper |
| On the nonexistence of uniformly optimal graphs for pair-connected reliability | 1992-06-25 | Paper |
| On minimum dominating sets with minimum intersection | 1992-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3032297 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3480096 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5752277 | 1989-01-01 | Paper |
| Research problems | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3815323 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3803159 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3819089 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3827946 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3792725 | 1987-01-01 | Paper |
| Convex labelings of trees | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3789614 | 1987-01-01 | Paper |
| Domination and location in acyclic graphs | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3789068 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3781800 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3798673 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3819102 | 1987-01-01 | Paper |
| A linear algorithm for the cutting center of a tree | 1986-01-01 | Paper |
| On iterated clique graphs with increasing diameters | 1986-01-01 | Paper |
| On k-graceful, countably infinite graphs | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3792710 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3728039 | 1985-01-01 | Paper |
| A note on similar edges and edge-unique line graphs | 1985-01-01 | Paper |
| Problems in graph theory: Graceful and sequential numberings of infinite graphs | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3343761 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3684148 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3712352 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3335812 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3347932 | 1984-01-01 | Paper |
| Sequentially additive graphs | 1983-01-01 | Paper |
| An Optimal Diagonal Tree Code | 1983-01-01 | Paper |
| How Few n-Permutations Contain All Possible k-Permutations? | 1983-01-01 | Paper |
| On k-graceful, locally finite graphs | 1983-01-01 | Paper |
| On repeated difference sequences of a permutation of N | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3331255 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4739946 | 1982-01-01 | Paper |
| Counterexamples to randić's conjecture on distance degree sequences for trees | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3659807 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3669464 | 1982-01-01 | Paper |
| A linear algorithm for the number of degree constrained subforests of a tree | 1982-01-01 | Paper |
| Information Dissemination in Trees | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3922712 | 1981-01-01 | Paper |
| On graphs containing a given graph as center | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3952131 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3898519 | 1981-01-01 | Paper |
| On k-sequential and other numbered graphs | 1981-01-01 | Paper |
| On Locating a Facility to Service Areas within a Network | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3922726 | 1981-01-01 | Paper |
| Thek-nucleus of a graph | 1981-01-01 | Paper |
| Accretion centers: A generalization of branch weight centroids | 1981-01-01 | Paper |
| Minimean Location of Different Facilities on a Line Network | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3941456 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3950591 | 1981-01-01 | Paper |
| Conservative graphs | 1980-01-01 | Paper |
| Medians of arbitrary graphs | 1980-01-01 | Paper |
| A linear algorithm for a core of a tree | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3897072 | 1980-01-01 | Paper |
| Matchings and transversals in hypergraphs, domination and independence in trees | 1979-01-01 | Paper |
| Path coverings of the vertices of a tree | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3941442 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3863924 | 1979-01-01 | Paper |
| Gossips and telegraphs | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3858301 | 1979-01-01 | Paper |
| Permutations of the positive integers with restrictions on the sequence of differences. II | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3853639 | 1978-01-01 | Paper |
| Centers to centroids in graphs | 1978-01-01 | Paper |
| Soldering and point splitting | 1978-01-01 | Paper |
| A constructive characterization of trees with at least k disjoint maximum matchings | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4190642 | 1978-01-01 | Paper |
| On k-minimally n-edge-connected graphs | 1978-01-01 | Paper |
| On k-critical, n-connected graphs | 1978-01-01 | Paper |
| A Characterization of Soft Hypergraphs | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4192097 | 1978-01-01 | Paper |
| Enclaveless sets and MK-Systems | 1977-01-01 | Paper |
| Geodetic connectivity of graphs | 1977-01-01 | Paper |
| A Note on k-Critically n-Connected Graphs | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3866144 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4194977 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4180373 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4141850 | 1977-01-01 | Paper |
| Permutations of the positive integers with restrictions on the sequence of differences | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4132553 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4091979 | 1976-01-01 | Paper |
| On the optional hamiltonian completion problem | 1976-01-01 | Paper |
| R -Domination in Graphs | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4101858 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4103576 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4075485 | 1975-01-01 | Paper |
| Advances on the Hamiltonian Completion Problem | 1975-01-01 | Paper |
| A classification of 4-connected graphs | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4079642 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4060986 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5668506 | 1972-01-01 | Paper |
