نتایج جستجو برای: order graph

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

Journal: :Linear Algebra and its Applications 1990

Journal: :Electronic Journal of Probability 2021

Our main results are quantitative bounds in the multivariate normal approximation of centred subgraph counts random graphs generated by a general graphon and independent vertex labels. We interested these statistics because they key to understanding fluctuations regular — cornerstone dense graph limit theory. also identify resulting limiting Gaussian stochastic measures means theory generalised...

In this paper, we study matching integral graphs of small order. A graph is called matching integral if the zeros of its matching polynomial are all integers. Matching integral graphs were first studied by Akbari, Khalashi, etc. They characterized all traceable graphs which are matching integral. They studied matching integral regular graphs. Furthermore, it has been shown that there is no matc...

Journal: :bulletin of the iranian mathematical society 2015
g. r. rezaeezadeh m. bibak m. sajjadi

the prime graph $gamma(g)$ of a group $g$ is a graph with vertex set $pi(g)$, the set of primes dividing the order of $g$, and two distinct vertices $p$ and $q$ are adjacent by an edge written $psim q$ if there is an element in $g$ of order $pq$. let $pi(g)={p_{1},p_{2},...,p_{k}}$. for $pinpi(g)$, set $deg(p):=|{q inpi(g)| psim q}|$, which is called the degree of $p$. we also set $d(g):...

Journal: :IEEE Transactions on Knowledge and Data Engineering 2021

GNNs have been widely used in deep learning on graphs. They learn effective node representations. However, most methods ignore the heterogeneity. Methods designed for heterogeneous graphs, other hand, fail to complex semantic representations because they only use meta-paths instead of meta-graphs. Furthermore, cannot fully capture content-based correlations, as either do not self-attention mech...

Journal: :iranian journal of mathematical chemistry 2011
a. behmaram h. yousefi-azari

the wiener polarity index wp(g) of a molecular graph g of order n is the number ofunordered pairs of vertices u, v of g such that the distance d(u,v) between u and v is 3. in anearlier paper, some extremal properties of this graph invariant in the class of catacondensedhexagonal systems and fullerene graphs were investigated. in this paper, some new bounds forthis graph invariant are presented....

Journal: :iranian journal of mathematical chemistry 2011
z. yarahmadi

a topological index of a molecular graph g is a numeric quantity related to g which isinvariant under symmetry properties of g. in this paper we obtain the randić, geometricarithmetic,first and second zagreb indices , first and second zagreb coindices of tensorproduct of two graphs and then the harary, schultz and modified schultz indices of tensorproduct of a graph g with complete graph of ord...

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

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