Results 11 to 20 of about 112 (100)
On the planarity of line Mycielskian graph of a graph [PDF]
The line Mycielskian graph of a graph G, denoted by Lμ(G) is defined as the graph obtained from L(G) by adding q+1 new vertices E' = ei' : 1 ≤ i ≤ q and e, then for 1 ≤ i ≤ q , joining ei' to the neighbours of ei and to e.
Keerthi G. Mirajkar +1 more
doaj +2 more sources
LINE REGULAR FUZZY SEMIGRAPHS [PDF]
This paper introduce two types of edge degrees (line degree and near line degree) and total edge degrees (total line degree and total near line degree) of an edge in a fuzzy semigraph, where a fuzzy semigraph is defined as (V, σ, μ, η ...
ARCHANA S., PREETHI KUTTIPULACKAL
doaj +2 more sources
An extremal problem on potentially K p,1,1-graphic sequences
A sequence S is potentially K p,1,1 graphical if it has a realization containing a K p,1,1 as a subgraph, where K p,1,1 is a complete 3-partite graph with partition sizes p,1,1.
Chunhui Lai
doaj +1 more source
The irregularity Sombor index ISO is a recently introduced measure for graph irregularity, defined as the sum over all pairs of adjacent ! vertices u, v of the term, where du is the degree of the vertex u.
Kulli, Veerabhadrappa R. +2 more
core +6 more sources
Szeged Indices of Bicyclic Graphs with Applications as Molecular Descriptor [PDF]
Molecular descriptors are mathematical representations of molecular properties, generated through numerous algorithms. These numerical values are used to quantitatively represent the physical and chemical attributes of molecules. In the field of chemical
Babai, Azam +2 more
core +1 more source
Sum Geometric Harmonic Means Index of Graphs [PDF]
In this paper, the concept of sum geometric harmonic means index of a graph G, denoted by SGhm(G) is introduced and sum geometric harmonic means index SGhm(G) of few families of graphs is computed.
Mahde, Sultan Senan +2 more
core
The multiplicative Zagreb indices of graph operations [PDF]
Recently, Todeschini et al. (Novel Molecular Structure Descriptors - Theory and Applications I, pp. 73-100, 2010), Todeschini and Consonni (MATCH Commun. Math. Comput. Chem.
Das, Kinkar C., Çevik, Ahmet Sinan
core +2 more sources
Clique number and Girth of the Rough Co-zero Divisor Graph
This study aims to determine the Clique number, Girth and Maximal independence number of the Rough Co-zero divisor Graph corresponding to a Rough semiring (T, ∆, ∇). The methodology of these graph theoretical parameters are obtained using partition
et. al., Dr.B. Praba,
core +1 more source
The Minimum Harmonic Index for Unicyclic Graphs with Given Diameter
The harmonic index of a graph G is defined as the sum of the weights 2d(u)+d(v)${2 \over {d(u) + d(v)}}$ of all edges uv of G, where d(u) denotes the degree of a vertex u in G.
Zhong Lingping
doaj +1 more source
Computational Analysis of new Degree-based descriptors of oxide networks
Oxide networks have diverse applications in the polymer and pharmaceutical industries. Polynomials and degree-based topological indices have tendencies to correlate properties of molecular graphs.
Hussain Zafar +5 more
doaj +1 more source

