In a graph G, vertex (resp. an edge) metric generator is set of vertices S such that any pair edges) from G distinguished by at least one S. The cardinality smallest the dimension G. Sedlar and Škrekovski (0000) we determined unicyclic graphs it takes its value two consecutive integers. Therein, several cycle configurations were introduced greater values only if these present in graph. this pap...

the current age is called the information age. this has caused various media outlets to make efforts in this competitive environment (i.e. media competition) to have a larger share of the world audience. this is only possible when the media can play out an active and distinguished role in the society. in this competitive space, what makes a particular media form in the world distinguished is th...

Let $G$ be a tamely ramified reductive $p$-adic‎ ‎group‎. ‎We study distinction of a class of irreducible admissible representations‎ ‎of $G$ by the group of fixed points $H$ of an involution‎ ‎of $G$‎. ‎The representations correspond to $G$-conjugacy classes of‎ ‎pairs $(T,phi)$‎, ‎where $T$ is a‎ ‎tamely ramified maximal torus of $G$ and $phi$ is a quasicharacter‎ ‎of $T$ whose restriction t...

Distinguished Contributors The "OASIS Distinguished Contributor" designation is awarded to a select group of OASIS members who have made significant contributions to the advancement of open standards. We gratefully acknowledge these outstanding individuals for their impact on the global information society.

Two-way transducers are ordinary finite two-way automata that are provided with a one-way write-only tape. They perform a word to word transformation. Unlike one-way transducers, no characterization of these objects as such exists so far except for the deterministic case. We study the other particular case where the input and output alphabets are both unary but when the transducer is not necess...