نتایج جستجو برای: x join of graphs

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

Journal: :Discrete Applied Mathematics 2009
Heping Zhang Yujun Yang Chuanwen Li

Let G 1 + G 2 , G 1 • G 2 and G 1 {G 2 } be the join, corona and cluster of graphs G 1 and G 2 , respectively. In this paper, Kirchhoff index formulae of these composite graphs are given.

Journal: :journal of sciences, islamic republic of iran 2014
b. tolue a. erfanian a. jafarzadeh

let g be a fixed element of a finite group g. we introduce the g-noncommuting graph of g whose vertex set is whole elements of the group g and two vertices x,y are adjacent whenever [x,y] g  and  [y,x] g. we denote this graph by . in this paper, we present some graph theoretical properties of g-noncommuting graph. specially, we investigate about its planarity and regularity, its clique number a...

We introduce the notion of uniform number of a graph. The  uniform number of a connected graph $G$ is the least cardinality of a nonempty subset $M$ of the vertex set of $G$ for which the function $f_M: M^crightarrow mathcal{P}(X) - {emptyset}$ defined as $f_M(x) = {D(x, y): y in M}$ is a constant function, where $D(x, y)$ is the detour distance between $x$ and $y$ in $G$ and $mathcal{P}(X)$ ...

Journal: :Discrete Mathematics 1999
Mostafa Blidia Pierre Duchet Henry Jacob Frédéric Maffray Henry Meyniel

We consider some classical constructions of graphs: join of two graphs, duplication of a vertex, and show that they behave nicely from the point of view of the existence of kernels. c © 1999 Elsevier Science B.V. All rights reserved.

Journal: :Graphs and Combinatorics 2021

We introduce joins of signed graphs and explore the chromatic number all-positive all-negative joins. prove an analogue to theorem that join two equals sum their numbers. Given graphs, is usually less than numbers, by amount depends on new concept deficiency a signed-graph coloration.

Journal: :Acta Mathematica Hungarica 2023

Let $$G = (V,E)$$ be a connected simple graph of order p and size q. A G is called local antimagic if admits labeling. bijection $$f \colon E \to \{1,2,\ldots,q\}$$ labeling for any two adjacent vertices $$u$$ $$v$$ , we have $$f^+(u) \ne f^+(v)$$ where \sum_{e\in E(u)} f(e)$$ $$E(u)$$ the set edges incident to . Thus, induces proper vertex coloring assigned color $$f^+(v)$$ The chromatic numbe...

Journal: :European Journal of Pure and Applied Mathematics 2020

Journal: :European Journal of Pure and Applied Mathematics 2020

ABSTRACT. Suppose G is a graph, A(G) its adjacency matrix and f(G, x)=x^n+a_(n-1)x^(n-1)+... is the characteristic polynomial of G. The matching polynomial of G is defined as M(G, x) = x^n-m(G,1)x^(n-2) + ... where m(G,k) is the number of k-matchings in G. In this paper, we determine the relationship between 2k-th coefficient of characteristic polynomial, a_(2k), and k-th coefficient of matchin...

Journal: :European Journal of Pure and Applied Mathematics 2022

This study deals with the forcing subsets of a minimum connected co-independent hop dominating sets in graphs. Bounds or exact values domination numbers graphs resulting from some binary operations such asjoin and corona are determined.Some main results generated this include characterization sets, for these types bounds join

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

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