On the distance paired-domination of circulant graphs.

Wang, Haoli; Xu, Xirong; Yang, Yuansheng; Wang, Guoqing; Lü, Kai

Displaying similar documents to “On the distance paired-domination of circulant graphs.”

The convexity graph of minimal total dominating functions of a graph

S. Arumugam, Sithara Jerry (2012)

Kragujevac Journal of Mathematics

Similarity:

Upper signed total domination number of directed graphs

Seyed Mahmoud Sheikholeslami (2012)

Kragujevac Journal of Mathematics

Similarity:

A New Proof of the Szeged-Wiener Theorem

H. Khodashenas, M. J. Nadjafi-Arani, A. R. Ashrafi, I. Gutman (2011)

Kragujevac Journal of Mathematics

Similarity:

On amply regular graphs with $b_{1} \leq 5$ .

Nirova, M.S. (2007)

Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]

Similarity:

Thom polynomials and Schur functions: the singularities $I_{2, 2} (-)$

Piotr Pragacz (2007)

Annales de l’institut Fourier

Similarity:

We give the Thom polynomials for the singularities $I_{2, 2}$ associated with maps $(ℂ^{•}, 0) \to (ℂ^{• + k}, 0)$ with parameter $k \geq 0$ . Our computations combine the characterization of Thom polynomials via the “method of restriction equations” of Rimanyi et al. with the techniques of Schur functions.

Greedy and lazy representations in negative base systems

Tomáš Hejda, Zuzana Masáková, Edita Pelantová (2013)

Kybernetika

Similarity:

We consider positional numeration systems with negative real base $- β$ , where $β > 1$ , and study the extremal representations in these systems, called here the greedy and lazy representations. We give algorithms for determination of minimal and maximal $(- β)$ -representation with respect to the alternate order. We also show that both extremal representations can be obtained as representations in the positive base $β^{2}$ with a non-integer alphabet. This enables us to characterize digit sequences admissible...