نتایج جستجو برای: cartesian product and strong product

تعداد نتایج: 16887447  

Journal: :The Electronic Journal of Combinatorics 2015

Journal: :Discrete Mathematics 2014
Marc Hellmuth Lydia Ostermeier Peter F. Stadler

Equivalence relations on the edge set of a graph G that satisfy restrictive conditions on chordless squares play a crucial role in the theory of Cartesian graph products and graph bundles. We show here that such relations in a natural way induce equitable partitions on the vertex set of G, which in turn give rise to quotient graphs that can have a rich product structure even if G itself is prime.

2015
MAHDIEH AZARI ALI IRANMANESH M. AZARI A. IRANMANESH

The multiplicative sum Zagreb index is defined for a simple graph G as the product of the terms dG(u)+dG(v) over all edges uv∈E(G) , where dG(u) denotes the degree of the vertex u of G . In this paper, we present some lower bounds for the multiplicative sum Zagreb index of several graph operations such as union, join, corona product, composition, direct product, Cartesian product and strong pro...

Betweenness centrality is a distance-based invariant of graphs. In this paper, we use lexicographic product to compute betweenness centrality of some important classes of graphs. Finally, we pose some open problems related to this topic.

1963
R. BROWN

Introduction THE study of topologies on X x Y is motivated by some outstanding deficiencies of the cartesian, that is the usual, topology on the product of spaces. (Throughout this paper all spaces will be assumed to be Hausdorff.) Firstly, the cartesian product of identification maps is not, in general, an identification map. As a consequence certain natural products such as the join and smash...

Journal: :Journal of Mathematics 2021

The sigma coindex is defined as the sum of squares differences between degrees all nonadjacent vertex pairs. In this paper, we propose some mathematical properties coindex. Later, present precise results for coindices various graph operations such tensor product, Cartesian lexicographic disjunction, strong union, join, and corona product.

Journal: :Математички билтен/BULLETIN MATHÉMATIQUE DE LA SOCIÉTÉ DES MATHÉMATICIENS DE LA RÉPUBLIQUE MACÉDOINE 2019

2010
Sandi Klavžar

The Cartesian product of graphs was introduced more than 50 years ago and many fundamental results were obtained since then. Nevertheless, in the last years several basic problems on the Cartesian product were solved and interesting theorems proved on topics of contemporary interest in graph theory. Here we survey recent developments on the structure of the Cartesian product with emphasis on th...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید