Zobrazeno 1 - 10
of 72
pro vyhledávání: '"Henry Martyn Mulder"'
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 17, Iss 3, Pp 1028-1038 (2020)
In this paper we introduce two concepts related to resolvability and the metric dimension of graphs. The kth dimension of a graph G is the maximum cardinality of a subset of vertices of G that is resolved by a set S of order k. Some first results are
Externí odkaz:
https://doaj.org/article/84bd270fd36248e29c3e875c5fd19759
Publikováno v:
Communications in Combinatorics and Optimization, Vol 5, Iss 1, Pp 69-81 (2020)
Let x and y be two distinct vertices in a connected graph G. The x, ylocation of a vertex w is the ordered pair of distances from w to x and y, that is, the ordered pair (d(x, w), d(y, w)). A set of vertices W in G is x, y-located if any two vertic
Externí odkaz:
https://doaj.org/article/103220c5d51f4a50a9948262f71629bf
Publikováno v:
Communications in Combinatorics and Optimization, Vol 4, Iss 2, Pp 151-171 (2019)
A set of vertices $S$ in a connected graph $G$ is a different-distance set if, for any vertex $w$ outside $S$, no two vertices in $S$ have the same distance to $w$. The lower and upper different-distance number of a graph are the order of a smallest
Externí odkaz:
https://doaj.org/article/7f744179ede74385a340d96ee15cf757
Autor:
Hemanshu Kaul, Henry Martyn Mulder
In the past 50 years, discrete mathematics has developed as a far-reaching and popular language for modeling fundamental problems in computer science, biology, sociology, operations research, economics, engineering, etc. The same model may appear in
Publikováno v:
Mathematical Social Sciences. 109:164-174
This paper considers voting rules for two alternatives, viz. the simple majority rule of K.O. May, the majority rule with bias of Fishburn and others, and the majority rule by difference of votes of Goodin and List, and of Llamazares. These all have
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::780db649e38b75e21849c8479858d998
https://doi.org/10.1016/j.mathsocsci.2020.12.001
https://doi.org/10.1016/j.mathsocsci.2020.12.001
Publikováno v:
Discrete Applied Mathematics. 284:316-321
A location function on a finite connected graph G takes as input any k -tuple of vertices (a profile) and outputs a single vertex. If G is a full y gated graph, then a target location function is defined by a predetermined vertex (the target) and out
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::52a98ec8956eeafd7421f7940d9bde9c
https://doi.org/10.1016/j.dam.2020.03.050
https://doi.org/10.1016/j.dam.2020.03.050
Autor:
Robert E. Jamison, Henry Martyn Mulder
Publikováno v:
Discrete Mathematics. 341:3021-3028
A graph G is dyadic provided it has a representation v → S v from vertices v of G to subtrees S v of a host tree T with maximum degree 3 such that ( i ) v and w are adjacent in G if and only if S v and S w share at least three nodes and ( i i ) eac
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::47eac893f9e894306350d4ab97b65b0b
https://doi.org/10.1016/j.disc.2018.07.019
https://doi.org/10.1016/j.disc.2018.07.019
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 38, Iss 1, Pp 39-48 (2018)
In this note we extend the Mulder-Nebeský characterization of the interval function of a connected graph to the disconnected case. One axiom needs to be adapted, but also a new axiom is needed in addition.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4cbdc230f61d8d93c07f0e5fd1d8c281
https://doaj.org/article/e1cf17d06e064108aebcc088ab835d7e
https://doaj.org/article/e1cf17d06e064108aebcc088ab835d7e
Autor:
Henry Martyn Mulder, Robert E. Jamison
Publikováno v:
Discrete Mathematics. 340:2301-2306
A graph G is Θ3-closed provided any two vertices of G that are joined by three internally disjoint paths are adjacent. We show that the Θ3-closed graphs are precisely those that can be obtained by gluing together cliques and cycles along vertices o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0561804e0a8f7e8fe6e5d2ea6bae7b25
https://doi.org/10.1016/j.disc.2017.05.002
https://doi.org/10.1016/j.disc.2017.05.002
Autor:
Shilpa Mohandas, Henry Martyn Mulder, Divya Sindhu Lekha, Ajitha R. Subhamathi, Manoj Changat
Publikováno v:
Discrete Applied Mathematics. 228:50-59
A median (antimedian) of a profile of vertices on a graph G is a vertex that minimizes (maximizes) the sum of the distances to the elements in the profile. The median (antimedian) function has as output the set of medians (antimedians) of a profile.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7333b02e66f0a6b653fcd1d193950973
https://doi.org/10.1016/j.dam.2016.04.013
https://doi.org/10.1016/j.dam.2016.04.013