Currently displaying 1 – 2 of 2

Showing per page

Order by Relevance | Title | Year of publication

Line graphs: their maximum nullities and zero forcing numbers

Shaun FallatAbolghasem Soltani — 2016

Czechoslovak Mathematical Journal

The maximum nullity over a collection of matrices associated with a graph has been attracting the attention of numerous researchers for at least three decades. Along these lines various zero forcing parameters have been devised and utilized for bounding the maximum nullity. The maximum nullity and zero forcing number, and their positive counterparts, for general families of line graphs associated with graphs possessing a variety of specific properties are analysed. Building upon earlier work, where...

Edge-Transitive Lexicographic and Cartesian Products

Wilfried ImrichAli IranmaneshSandi KlavžarAbolghasem Soltani — 2016

Discussiones Mathematicae Graph Theory

In this note connected, edge-transitive lexicographic and Cartesian products are characterized. For the lexicographic product G ◦ H of a connected graph G that is not complete by a graph H, we show that it is edge-transitive if and only if G is edge-transitive and H is edgeless. If the first factor of G ∘ H is non-trivial and complete, then G ∘ H is edge-transitive if and only if H is the lexicographic product of a complete graph by an edgeless graph. This fixes an error of Li, Wang, Xu, and Zhao...

Page 1

Download Results (CSV)