• No results found

[PDF] Top 20 On S Degrees of Vertices and S Indices of Graphs

Has 10000 "On S Degrees of Vertices and S Indices of Graphs" found on our website. Below are the top 20 most common "On S Degrees of Vertices and S Indices of Graphs".

On S Degrees of Vertices and S Indices of Graphs

On S Degrees of Vertices and S Indices of Graphs

... topological indices of molecular graphs are widely used for establishing correlations between the structure of a molecular compound and its physicochemical properties or biological ...These indices ... See full document

5

The multiplicative version of degree distance and the multiplicative version

The multiplicative version of degree distance and the multiplicative version

... topological indices and graph invariants based on distances between vertices of a graph are widely used for characterizing molecular graphs, establishing relationships between struc- ture and ... See full document

13

ON CERTAIN TOPOLOGICAL INDICES OF THE DERIVED GRAPHS OF SUBDIVISION GRAPHS

ON CERTAIN TOPOLOGICAL INDICES OF THE DERIVED GRAPHS OF SUBDIVISION GRAPHS

... Abstract. The derived graph [G] † of a graph G is the graph having the same vertex set as G, with two vertices of [G] † being adjacent if and only if their distance in G is two. Topological indices are ... See full document

9

A NOTE ON CERTAIN TOPOLOGICAL INDICES OF THE DERIVED GRAPHS OF SUBDIVISION GRAPHS

A NOTE ON CERTAIN TOPOLOGICAL INDICES OF THE DERIVED GRAPHS OF SUBDIVISION GRAPHS

... Abstract. In this note, we correct some errors in S. M. Hosamani et al. [TWMS J. App. Eng. Math., 6(2), (2016) pp. 324–332]. The derived graph [G] † of a graph G is the graph having the same vertex set as G, with ... See full document

12

Strong and weak vertex edge mixed domination on s   valued graphs

Strong and weak vertex edge mixed domination on s valued graphs

... in S valued graph and prove some simple ...the vertices belonging to the spanning subgraph of N S ...the degrees of the edges and vertices belonging to the ev weight m dominating set, ... See full document

6

On discriminativity of vertex-degree-based indices

On discriminativity of vertex-degree-based indices

... benzenoid graphs the calculation of all the above specified topological indices is much simplified by the fact that these graphs possess only vertices of degree 2 and 3, and therefore there ... See full document

7

Upper bounds for the number of spanning trees of graphs

Upper bounds for the number of spanning trees of graphs

... This paper is organized as follows. In Section , we give some useful lemmas. In Sec- tion , we obtain some upper bounds for the number of spanning trees of graphs in terms of the number of vertices, the ... See full document

7

On Total Vertex Irregularity Strength of Triangle Related Graphs

On Total Vertex Irregularity Strength of Triangle Related Graphs

... Knodel graphs. For graphs with no isolated vertices, Pzrybylo [11] gave bounds for tvs (G ) in terms of the order, minimum and maximum degrees of G ...-regular graphs (d > 0), ... See full document

9

Probabilistic Properties of F-indices of Trees

Probabilistic Properties of F-indices of Trees

... connected graphs without cycles, and their properties are basics of graph ...(vertex degrees) to find molecular structures ...(molecular graphs) have different values for F-indiex, then their struc- ... See full document

9

Distance-Based Topological Indices and Double graph

Distance-Based Topological Indices and Double graph

... Topological indices of molecules can be carried out through their molecular ...called vertices and edges, ...topological indices of chemical graphs relates the certain physical, biological or ... See full document

9

Note on multiple Zagreb indices

Note on multiple Zagreb indices

... All graphs considered in this paper are simple and ...called vertices and edges of the graph, ...the vertices u and v, then we write e = uv and say "u and v are ... See full document

7

ZAGREB INDICES AND MULTIPLICATIVE ZAGREB INDICES OF DOUBLE GRAPHS OF SUBDIVISION GRAPHS

ZAGREB INDICES AND MULTIPLICATIVE ZAGREB INDICES OF DOUBLE GRAPHS OF SUBDIVISION GRAPHS

... graph S(G) of a graph G is the graph obtained from G by replacing each of its edges by a path of length 2, or equivalently by inserting an additional vertex into each edge of ...Subdivision graphs are used ... See full document

9

Preparation and Characterization of Some Magnetic Nanocomposites of Biodegradable Polyurethane Based on (S)-Histidine

Preparation and Characterization of Some Magnetic Nanocomposites of Biodegradable Polyurethane Based on (S)-Histidine

... Optically active co-poly(ester amide urethane)s were prepared in three stages from chemical reactions. Two new optically active acids were synthesized from the reaction of (s)-histidine with adipoyl ... See full document

13

Locating Total Domination Number in Strong Product of Two Paths

Locating Total Domination Number in Strong Product of Two Paths

... in S from columns that contain two or more vertices in ...more vertices in ...columns, S ' is this subgraph’s locating-total dominating ...| S ' | can be less than n ' and one EC cannot ... See full document

7

Vertex Domination Number in S-valued Graphs

Vertex Domination Number in S-valued Graphs

... in graphs has been introduced by Berge [1], and continued by several ...valued graphs. In [8], we studied the S- valued graphs in ...the S-valued graph G S ...of S- valued ... See full document

6

<p>Impact of Fucosylation on Self-Assembly of Prostate and Breast Tumor Spheroids by Using Cyclo-RGDfK(TPP) Peptide and Image Object Detection</p>

<p>Impact of Fucosylation on Self-Assembly of Prostate and Breast Tumor Spheroids by Using Cyclo-RGDfK(TPP) Peptide and Image Object Detection</p>

... Prostate cancer cells were grown at approximately 90% con fl uence in T75 tissue culture fl asks. To measure α 1,6 fucose linkages, cells were stained with biotinylated AOL at 10µg/mL and dissolved in PBS containing 2% FBS ... See full document

21

On clique-colouring of graphs with few P4’s

On clique-colouring of graphs with few P4’s

... in linear time through the modular decomposition of that graph [13, 28]. We have showed that every serial graph, ev- ery separable p-connected graph and every neighbourhood decomposable graph is 2-clique-colourable. ... See full document

7

Solving the 2 Disjoint connected subgraphs problem faster than 2n

Solving the 2 Disjoint connected subgraphs problem faster than 2n

... C OVER , #H AMILTONIAN C YCLES and SAT, the currently best known time com- plexity is of the form O(2 n n O(1) ), which is a result of applying dynamic program- ming over subsets, the inclusion-exclusion principle or a ... See full document

14

The Effectiveness of P.O.S.S.E Strategy on Improving Reading Comprehension of the EFL University Students

The Effectiveness of P.O.S.S.E Strategy on Improving Reading Comprehension of the EFL University Students

... Teaching Reading Analytical Exposition Text to Senior High School Students By Using POSSE (Predict, Organize, Search, Summarize, Evaluate) Strategy .JELT journal, Vol [r] ... See full document

11

Influence of socioeconomic factors and region of residence on cancer stage of malignant melanoma: a Danish nationwide population-based study

Influence of socioeconomic factors and region of residence on cancer stage of malignant melanoma: a Danish nationwide population-based study

... Table 2 shows that patients with shorter education, with lower income, living without partner, with male sex, higher age, with comorbidity and who lived in the North- ern, Central or Z[r] ... See full document

9

Show all 10000 documents...

Related subjects