نتایج جستجو برای: distinct edge geodetic decomposition number

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

Journal: :Bulletin of the Malaysian Mathematical Sciences Society 2019

Journal: :Electr. J. Comb. 2002
Herbert Fleischner Robert R. Molina Ken W. Smith Douglas B. West

Let G be a connected graph that is the edge-disjoint union of two paths of length n, where n ≥ 2. Using a result of Thomason on decompositions of 4-regular graphs into pairs of Hamiltonian cycles, we prove that G has a third path of length n. The “two-path conjecture” states that if a graph G is the edge-disjoint union of two paths of length n with at least one common vertex, then the graph has...

2000
Cynthia A. Chambers Leslie J. Berg Sara Gozalo-Sanmillan James M. McNally Meei Y. Lin

M. R. Darafsheh P. Nosratpour,

Let $G$ be a finite group. The prime graph of $G$ is a graph $Gamma(G)$ with vertex set $pi(G)$, the set of all prime divisors of $|G|$, and two distinct vertices $p$ and $q$ are adjacent by an edge if $G$ has an element of order $pq$. In this paper we prove that if $Gamma(G)=Gamma(G_2(5))$, then $G$ has a normal subgroup $N$ such that $pi(N)subseteq{2,3,5}$ and $G/Nequiv G_2(5)$.

Let $G$ be a simple graph of order $n$ and size $m$.The edge covering of $G$ is a set of edges such that every vertex of $G$ is incident to at least one edge of the set. The edge cover polynomial of $G$ is the polynomial$E(G,x)=sum_{i=rho(G)}^{m} e(G,i) x^{i}$,where $e(G,i)$ is the number of edge coverings of $G$ of size $i$, and$rho(G)$ is the edge covering number of $G$. In this paper we stud...

Journal: :Pattern Recognition 2021

• Decompose the global thermodynamic entropy of a network into components associated with its edges. Calculate edge from partition functions classical and quantum statistics. Apply on synthetic real-world networks to evaluate qualitative quantitative differences in performance. In previous study, we have explored how decompose using graph-spectral decomposition technique. Here, develop this wor...

2000
Kazuo Minami

In this paper, we discuss vector and parallel tuning of GeoFEM and the Householder QR decomposition process being solid earth simulation codes. Process of GeoFEM code can be roughly divided into two parts, Matrix Assemble part and Solver part. Currently, GeoFEM's parallel iterative solver has attained good parallel and vector performance, and GeoFEM's Matrix Assemble part has attained good para...

Journal: :Data Science Journal 2013
Tetsuo Takanami Genshiro Kitagawa Hui Peng Alan T. Linde I. Selwyn Sacks

The Earth’s surface is under the continuous influence of a variety of natural forces and human induced sources. Strain data are good examples of such disturbed signals. To determine the geodetic strain behavior before and after the 2003 Tokachi-oki earthquake (M8.0), we decomposed the disturbed strain data into trend, air pressure, earth tide, and precipitation responses components. The decompo...

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

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