نتایج جستجو برای: semi total line graph

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

Journal: :Discrete Mathematics 1999

Journal: :Int. J. Math. Mathematical Sciences 2004
Jay Bagga

The line graph L(G) of a graph G is defined to have as its vertices the edges of G, with two being adjacent if the corresponding edges share a vertex in G. Line graphs have a rich history. The name line graph was first used by Harary and Norman in 1960. But line graphs were the subject of investigation as far back as 1932 in a paper by H. Whitney in which he showed that for connected graphs, ed...

Journal: :Journal of Algorithms 1996

Journal: :transactions on combinatorics 2011
adel p. kazemi

let $k$ be a positive integer. a subset $s$ of $v(g)$ in a graph $g$ is a $k$-tuple total dominating set of $g$ if every vertex of $g$ has at least $k$ neighbors in $s$. the $k$-tuple total domination number $gamma _{times k,t}(g)$ of $g$ is the minimum cardinality of a $k$-tuple total dominating set of $g$. if$v(g)=v^{0}={v_{1}^{0},v_{2}^{0},ldots ,v_{n}^{0}}$ and $e(g)=e_{0}$, then for any in...

2017
Rasmus Kyng Jakub W. Pachocki Richard Peng Sushant Sachdeva

A spectral sparsifier of a graph G is a sparser graph H that approximately preserves the quadratic form of G, i.e. for all vectors x, xLGx ≈ x T LHx, where LG and LH denote the respective graph Laplacians. Spectral sparsifiers generalize cut sparsifiers, and have found many applications in designing graph algorithms. In recent years, there has been interest in computing spectral sparsifiers in ...

Let $G$ be a $(p,q)$ graph. Let $f:V(G)to{1,2, ldots, k}$ be a map where $k in mathbb{N}$ and $k>1$. For each edge $uv$, assign the label $gcd(f(u),f(v))$. $f$ is called $k$-Total prime cordial labeling of $G$ if $left|t_{f}(i)-t_{f}(j)right|leq 1$, $i,j in {1,2, cdots,k}$ where $t_{f}(x)$ denotes the total number of vertices and the edges labelled with $x$. A graph with a $k$-total prime cordi...

Journal: :Pure and Applied Mathematics Journal 2020

Journal: :Letters in Mathematical Physics 2016

Journal: :Pattern Recognition 2021

• The global and local structure are jointly considered for deep graph learning networks. relationship of the structures mined by hierarchical progressive learning. different fusion dynamically encoded their interdependence. Graph (GL) can capture distribution (graph structure) data based on convolutional networks (GCN), quality directly influences GCN semi-supervised classification. Most exist...

2006
Andrew R. Wade

We give laws of large numbers (in the Lp sense) for the total length of the k-nearest neighbours (directed) graph and the j-th nearest neighbour (directed) graph in Rd, d ∈ N, with power-weighted edges. We deduce a law of large numbers for the standard nearest neighbour (undirected) graph. We give the limiting constants, in the case of uniform random points in (0, 1)d, explicitly. Also, we give...

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

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