Displaying similar documents to “On path-quasar Ramsey numbers”

The Crossing Numbers of Products of Path with Graphs of Order Six

Marián Klešč, Jana Petrillová (2013)

Discussiones Mathematicae Graph Theory

Similarity:

The crossing numbers of Cartesian products of paths, cycles or stars with all graphs of order at most four are known. For the path Pn of length n, the crossing numbers of Cartesian products G⃞Pn for all connected graphs G on five vertices are also known. In this paper, the crossing numbers of Cartesian products G⃞Pn for graphs G of order six are studied. Let H denote the unique tree of order six with two vertices of degree three. The main contribution is that the crossing number of the...

Maximum Independent Sets in Direct Products of Cycles or Trees with Arbitrary Graphs

Tjaša Paj, Simon Špacapan (2015)

Discussiones Mathematicae Graph Theory

Similarity:

The direct product of graphs G = (V (G),E(G)) and H = (V (H),E(H)) is the graph, denoted as G×H, with vertex set V (G×H) = V (G)×V (H), where vertices (x1, y1) and (x2, y2) are adjacent in G × H if x1x2 ∈ E(G) and y1y2 ∈ E(H). Let n be odd and m even. We prove that every maximum independent set in Pn×G, respectively Cm×G, is of the form (A×C)∪(B× D), where C and D are nonadjacent in G, and A∪B is the bipartition of Pn respectively Cm. We also give a characterization of maximum independent...

Value-peaks of permutations.

Bouchard, Pierre, Chang, Hungyung, Ma, Jun, Yeh, Jean, Yeh, Yeong-Nan (2010)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

The Wiener, Eccentric Connectivity and Zagreb Indices of the Hierarchical Product of Graphs

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

New bounds for the broadcast domination number of a graph

Richard Brewster, Christina Mynhardt, Laura Teshima (2013)

Open Mathematics

Similarity:

A dominating broadcast on a graph G = (V, E) is a function f: V → {0, 1, ..., diam G} such that f(v) ≤ e(v) (the eccentricity of v) for all v ∈ V and such that each vertex is within distance f(v) from a vertex v with f(v) > 0. The cost of a broadcast f is σ(f) = Σv∈V f(v), and the broadcast number λ b (G) is the minimum cost of a dominating broadcast. A set X ⊆ V(G) is said to be irredundant if each x ∈ X dominates a vertex y that is not dominated by any other vertex in X; possibly...