نتایج جستجو برای: direct product graphs

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

A. Kaveh, H. Rahami,

In this paper simple formulae are derived for calculating the number of spanning trees of different product graphs. The products considered in here consists of Cartesian, strong Cartesian, direct, Lexicographic and double graph. For this purpose, the Laplacian matrices of these product graphs are used. Form some of these products simple formulae are derived and whenever direct formulation was n...

Journal: :AIMS mathematics 2021

<abstract><p>Let $ G be a graph with vertex set V(G) $. A function f:V(G)\rightarrow \{0, 1, 2\} is Roman dominating on if every v\in for which f(v) = 0 adjacent to at least one u\in such that f(u) 2 The domination number of the minimum weight \omega(f) \sum_{x\in V(G)}f(x) among all functions f In this article we study direct product graphs and rooted graphs. Specifically, give sev...

Journal: :iranian journal of mathematical chemistry 0
b basavanagoud karnatak university dharwad s. patil karnatak university v r desai karnatak university m tavakoli ferdowsi university of mashhad a r ashrafi university of kashan

a connected graph g is said to be neighbourly irregular graph if no two adjacent vertices of g have same degree. in this paper we obtain neighbourly irregular derived graphs such as semitotal-point graph, k^{tℎ} semitotal-point graph, semitotal-line graph, paraline graph, quasi-total graph and quasivertex-total graph and also neighbourly irregular of some graph products.

The notion of Asteroidal triples was introduced by Lekkerkerker and Boland [6]. D.G.Corneil and others [2], Ekkehard Kohler [3] further investigated asteroidal triples. Walter generalized the concept of asteroidal triples to asteroidal sets [8]. Further study was carried out by Haiko Muller [4]. In this paper we find asteroidal numbers for Direct product of cycles, Direct product of path and cy...

Journal: :Applied Mathematics Letters 2000

Journal: :Journal of Combinatorics 2020

A defensive alliance in a graph is a set $S$ of vertices with the property that every vertex in $S$ has at most one moreneighbor outside of $S$ than it has inside of $S$. A defensive alliance $S$ is called global if it forms a dominating set. The global defensive alliance number of a graph $G$ is the minimum cardinality of a global defensive alliance in $G$. In this article we study the global ...

Journal: :Ars Comb. 1998
Pranava K. Jha Sandi Klavzar

Let α(G) denote the independence number of a graph G and let G ×H be the direct product of graphs G and H. Set α(G ×H) = max{α(G) · |H|, α(H) · |G|}. If G is a path or a cycle and H is a path or a cycle then α(G×H) = α(G×H). Moreover, this equality holds also in the case when G is a bipartite graph with a perfect matching and H is a traceable graph. However, for any graph G with at least one ed...

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

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