A New Proof of the Szeged-Wiener Theorem

H. Khodashenas; M. J. Nadjafi-Arani; A. R. Ashrafi; I. Gutman

Displaying similar documents to “A New Proof of the Szeged-Wiener Theorem”

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:

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

Nirova, M.S. (2007)

Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]

Similarity:

On the distance paired-domination of circulant graphs.

Wang, Haoli, Xu, Xirong, Yang, Yuansheng, Wang, Guoqing, Lü, Kai (2011)

Bulletin of the Malaysian Mathematical Sciences Society. Second Series

Similarity:

Acyclic numbers of graphs.

Samodivkin, Vladmir (2009)

Acta Mathematica Academiae Paedagogicae Nyí regyháziensis. New Series [electronic only]

Similarity:

An extension theorem for supertemperatures.

Watson, Neil A. (2008)

Annales Academiae Scientiarum Fennicae. Mathematica

Similarity:

Combinatorial Miller-Morita-Mumford classes and Witten cycles.

Igusa, Kiyoshi (2004)

Algebraic & Geometric Topology

Similarity:

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...