نتایج جستجو برای: derived graphs

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

Journal: :Mathematical Problems in Engineering 2022

Distance based topological indices (TIs) play a vital role in the study of various structural and chemical aspects for molecular graphs. The first distance-based TI is used to find boiling point paraffin. connection distance (CD) index latest developed that defined as sum all products distances between pair vertices with their respective numbers . In this paper, we computed CD different derived...

Journal: :transactions on combinatorics 2012
mehdi eliasi

the first ($pi_1$) and the second $(pi_2$) multiplicative zagreb indices of a connected graph $g$, with vertex set $v(g)$ and edge set $e(g)$, are defined as $pi_1(g) = prod_{u in v(g)} {d_u}^2$ and $pi_2(g) = prod_{uv in e(g)} {d_u}d_{v}$, respectively, where ${d_u}$ denotes the degree of the vertex $u$. in this paper we present a simple approach to order these indices for connected graphs on ...

Journal: :journal of algebra and related topics 2014
m. alaeiyan l. pourmokhtar m. k. hosseinpoor

a graph is textit{symmetric}, if its automorphism group is transitive on the set of its arcs. in this paper, we  classifyall the connected cubic symmetric  graphs of order $36p$  and $36p^{2}$, for each prime $p$, of which the proof depends on the classification of finite simple groups.

2016
Saeid Balaneshinkordan Alexander Kotov

Term graphs constructed from document collections as well as external resources, such as encyclopedias (DBpedia) and knowledge bases (Freebase and ConceptNet), have been individually shown to be effective sources of semantically related terms for query expansion, particularly in case of difficult queries. However, it is not known how they compare with each other in terms of retrieval effectiven...

A Mandi, P Chandra Pal P Pati S Kundu

In this work, attempts are made to study the dispersion of Love waves in dry sandy layer sandwiched between fiber reinforced layer and inhomogeneous half space.Inhomogeneity in half space associated with density and rigidity and considered in exponential form. Displacement components for fiber reinforced layer, dry sandy layer and inhomogeneous half-space have been obtained by using method of s...

Journal: :Mathematics 2022

An irregularity index IR(Γ) of a graph Γ is nonnegative numeric quantity (i.e., IR(Γ)≥0) such that IR(Γ)=0 iff regular graph. In this paper, we show IRC closely correlates with the normal boiling point Tbp and standard heat formation ΔHfo lower benzenoid hydrocarbons. The correlation models fit data efficiently for both are linear. We develop further mathematical properties by calculating its e...

Journal: :transactions on combinatorics 2016
chandrashekar adiga b‎. ‎r‎. ‎rakshith

‎in this paper we introduce mixed unitary cayley graph $m_{n}$‎ ‎$(n>1)$ and compute its eigenvalues‎. ‎we also compute the energy of‎ ‎$m_{n}$ for some $n$‎.

Journal: :Theor. Comput. Sci. 2001
Sergei L. Bezrukov Robert Elsässer

We consider an edge-isoperimetric problem (EIP) on the cartesian powers of graphs. One of our objectives is to extend the list of graphs for whose cartesian powers the lexicographic order provides nested solutions for the EIP. We present several new classes of such graphs that include as special cases all presently known graphs with this property. Our new results are applied to derive best poss...

Journal: :Theor. Comput. Sci. 2000
Bruno Courcelle

We introduce nite relational structures called sketches, that represent edge crossings in drawings of nite graphs. We consider the problem of characterizing sketches in Monadic Second-Order logic. We answer positively the question for framed sketches, i.e., for those representing drawings of graphs consisting of a planar connected spanning subgraph (the frame) augmented with additional edges th...

Journal: :Discrete Applied Mathematics 2017
Jennifer Diemunsch Nathan Graber Lucas Kramer Victor Larsen Lauren M. Nelsen Luke L. Nelsen Devon Sigler Derrick Stolee Charlie Suer

Let c : E(G) → [k] be an edge-coloring of a graph G, not necessarily proper. For each vertex v, let c̄(v) = (a1, . . . , ak), where ai is the number of edges incident to v with color i. Reorder c̄(v) for every v in G in nonincreasing order to obtain c∗(v), the color-blind partition of v. When c∗ induces a proper vertex coloring, that is, c∗(u) 6= c∗(v) for every edge uv in G, we say that c is col...

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

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