On the index of cactuses with  vertices.

Borovćanin, Bojana; Petrović, Miroslav

Displaying similar documents to “On the index of cactuses with $n$ vertices.”

On the index of cactuses with $n$ vertices.

Borovćanin, Bojana, Petrović, Miroslav (2006)

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

Similarity:

On the Index of Cactuses With n Vertices

Bojana Borovićanin, Miroslav Petrović (2006)

Publications de l'Institut Mathématique

Similarity:

Characterization of semientire graphs with crossing number 2

D. G. Akka, J. K. Bano (2002)

Mathematica Bohemica

Similarity:

The purpose of this paper is to give characterizations of graphs whose vertex-semientire graphs and edge-semientire graphs have crossing number 2. In addition, we establish necessary and sufficient conditions in terms of forbidden subgraphs for vertex-semientire graphs and edge-semientire graphs to have crossing number 2.

Laplacian integral graphs with maximum degree 3.

Kirkland, Steve (2008)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Graph equations for line graphs and n-th distance graphs.

Simic, Slobodan K. (1983)

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

Similarity:

Graphs which have pancyclic complements.

Straight, H.Joseph (1978)

International Journal of Mathematics and Mathematical Sciences

Similarity:

Selected Topics from the Theory of Graph Energy: Hypoenergetic Graph

Snježana Majstorović, Antoaneta Klobučar, Ivan Gutman (2009)

Zbornik Radova

Similarity:

A Triple of Heavy Subgraphs Ensuring Pancyclicity of 2-Connected Graphs

Wojciech Wide (2017)

Discussiones Mathematicae Graph Theory

Similarity:

A graph G on n vertices is said to be pancyclic if it contains cycles of all lengths k for k ∈ {3, . . . , n}. A vertex v ∈ V (G) is called super-heavy if the number of its neighbours in G is at least (n+1)/2. For a given graph H we say that G is H-f1-heavy if for every induced subgraph K of G isomorphic to H and every two vertices u, v ∈ V (K), dK(u, v) = 2 implies that at least one of them is super-heavy. For a family of graphs H we say that G is H-f1-heavy, if G is H-f1-heavy for...

On $(δ, χ)$ -bounded families of graphs.

Gyárfás, András, Zaker, Manouchehr (2011)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Independence number and disjoint theta graphs.

Fujita, Shinya, Magnant, Colton (2011)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Displaying similar documents to “On the index of cactuses with n vertices.”

Displaying similar documents to “On the index of cactuses with $n$ vertices.”