Contribution to the problem of the spectra of compound graphs.
I. Gutman (1978)
Publications de l'Institut Mathématique [Elektronische Ressource]
Similarity:
I. Gutman (1978)
Publications de l'Institut Mathématique [Elektronische Ressource]
Similarity:
I. Gutman, Olga Miljković, B. Zhou, M. Petrović (2006)
Bulletin, Classe des Sciences Mathématiques et Naturelles, Sciences mathématiques
Similarity:
Gillman, Richard Alan (1995)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Courcelle, Bruno (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Araujo, Oswaldo, Estrada, Mario, Morales, Daniel A., Rada, Juan (2005)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Beezer, Robert A., Farrell, E.J. (2000)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Hagos, Elias M. (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Ashrafi, A., Ghorbani, M., Hossein-Zadeh, M. (2011)
Serdica Journal of Computing
Similarity:
The eccentric connectivity index of a graph G, ξ^C, was proposed by Sharma, Goswami and Madan. It is defined as ξ^C(G) = ∑ u ∈ V(G) degG(u)εG(u), where degG(u) denotes the degree of the vertex x in G and εG(u) = Max{d(u, x) | x ∈ V (G)}. The eccentric connectivity polynomial is a polynomial version of this topological index. In this paper, exact formulas for the eccentric connectivity polynomial of Cartesian product, symmetric difference, disjunction and join of graphs are presented. ...
Matchett, Philip (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Chen, Shubo (2011)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Reza Jafarpour-Golzari (2022)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
We introduce a new concept namely the degree polynomial for the vertices of a simple graph. This notion leads to a concept, namely, the degree polynomial sequence which is stronger than the concept of degree sequence. After obtaining the degree polynomial sequence for some well-known graphs, we prove a theorem which gives a necessary condition for the realizability of a sequence of polynomials with positive integer coefficients. Also we calculate the degree polynomial for the vertices...
M. Tavakoli, F. Rahbarnia, A. R. Ashrafi (2013)
Kragujevac Journal of Mathematics
Similarity:
Hossein-Zadeh, S., Hamzeh, A., Ashrafi, A. (2012)
Serdica Journal of Computing
Similarity:
Let G1 = (V1, E1) and G2 = (V2, E2) be two graphs having a distinguished or root vertex, labeled 0. The hierarchical product G2 ⊓ G1 of G2 and G1 is a graph with vertex set V2 × V1. Two vertices y2y1 and x2x1 are adjacent if and only if y1x1 ∈ E1 and y2 = x2; or y2x2 ∈ E2 and y1 = x1 = 0. In this paper, the Wiener, eccentric connectivity and Zagreb indices of this new operation of graphs are computed. As an application, these topological indices for a class of alkanes are computed. ACM...
Gutman, Ivan (1991)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Gutman, Ivan (1992)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity: