Undirected and directed graphs with near polynomial growth

V.I. Trofimov

Displaying similar documents to “Undirected and directed graphs with near polynomial growth”

Independent vertex sets in some compound graphs.

Gutman, Ivan (1992)

Publications de l'Institut Mathématique. Nouvelle Série

Similarity:

On line-symmetric graphs

David Burns, S. Kapoor, P. Ostrand (1984)

Fundamenta Mathematicae

Similarity:

The Eccentric Connectivity Polynomial of some Graph Operations

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

Characterizing symmetric diametrical graphs of order 12 and diameter 4.

Al-Addasi, S., Al-Ezeh, H. (2002)

International Journal of Mathematics and Mathematical Sciences

Similarity:

Mean value for the matching and dominating polynomial

Jorge Luis Arocha, Bernardo Llano (2000)

Discussiones Mathematicae Graph Theory

Similarity:

The mean value of the matching polynomial is computed in the family of all labeled graphs with n vertices. We introduce the dominating polynomial of a graph whose coefficients enumerate the dominating sets for a graph and study some properties of the polynomial. The mean value of this polynomial is determined in a certain special family of bipartite digraphs.

Contribution to the problem of the spectra of compound graphs.

I. Gutman (1978)

Publications de l'Institut Mathématique [Elektronische Ressource]

Similarity:

The matching polynomial of a distance-regular graph.

Beezer, Robert A., Farrell, E.J. (2000)

International Journal of Mathematics and Mathematical Sciences

Similarity:

The characteristic polynomial of a graph is reconstructible from the characteristic polynomials of its vertex-deleted subgraphs and their complements.

Hagos, Elias M. (2000)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Some Comments on the Eigenspaces of Graphs

Dragoš M. Cvetković (1991)

Publications de l'Institut Mathématique

Similarity:

On independent vertices and edges of belt graphs.

Gutman, I. (1996)

Publications de l'Institut Mathématique. Nouvelle Série

Similarity:

γ-graphs of graphs

Gerd H. Fricke, Sandra M. Hedetniemi, Stephen T. Hedetniemi, Kevin R. Hutson (2011)

Discussiones Mathematicae Graph Theory

Similarity:

A set S ⊆ V is a dominating set of a graph G = (V,E) if every vertex in V -S is adjacent to at least one vertex in S. The domination number γ(G) of G equals the minimum cardinality of a dominating set S in G; we say that such a set S is a γ-set. In this paper we consider the family of all γ-sets in a graph G and we define the γ-graph G(γ) = (V(γ), E(γ)) of G to be the graph whose vertices V(γ) correspond 1-to-1 with the γ-sets of G, and two γ-sets, say D₁ and D₂, are adjacent in E(γ)...