Results 11 to 20 of about 41,896 (267)
Fuzzy Graph Structures with Application
In this article, we introduce the notions of maximal products of fuzzy graph structures, regular fuzzy graph structures, and describe these notions with examples and properties.
Muzzamal Sitara +2 more
doaj +1 more source
On the chromatic number of graphs with some restriction of vertex degrees
Graphs, for which the degree of a certain vertex is equal to (d + 1) and the degrees of all other vertices are at most d , d ≥ 3 , were considered. Properties were obtained to color vertices of these graphs in d colors.
S.N. Selezneva
doaj +1 more source
PREFERENTIAL ATTACHMENT WITH FITNESS DEPENDENT CHOICE
We study the asymptotic behavior of the maximum degree in the preferential attachment tree model with a choice based on both the degree and fitness of a vertex.
Y.A. Malyshkin
doaj +1 more source
In terms of soil conditions, clay minerals infrequently occur as homogenous mixtures of single constituents, gatherings, stages, or types of minerals.
Ahmad Al-Nashri Al-Hossain +2 more
doaj +1 more source
On K-Banhatti indices and entropy measure for rhodium (III) chloride via linear regression models
Rhodium (III) chloride is a metallic compound characterized by its shiny and silvery-white appearance. It possesses high reflectivity and exhibits excellent resistance to corrosion.
Mazhar Hussain +5 more
doaj +1 more source
On Extended Adjacency Index with Respect to Acyclic, Unicyclic and Bicyclic Graphs
For a (molecular) graph G, the extended adjacency index E A ( G ) is defined as Equation (1). In this paper we introduce some graph transformations which increase or decrease the extended adjacency ( E A ) index.
Bin Yang +4 more
doaj +1 more source
Reformulated Zagreb Indices of Some Derived Graphs
A topological index is a numeric quantity that is closely related to the chemical constitution to establish the correlation of its chemical structure with chemical reactivity or physical properties.
Jia-Bao Liu +4 more
doaj +1 more source
Usefulness of Combinations of Vertex-Degree Weighted Path Indices and Elements of a Universal Matrix
The mutually optimized combinations of vertex-degree weighted path indices and the vertex-degree vertex-distance weighted elements of the Universal matrix were applied in the way of TInew = ∑kN×PN(aN,bN,...) + kij×uij(aij,bij,cij).
Anton Perdih
doaj +1 more source
Cost-based analyses of random neighbor and derived sampling methods
Random neighbor sampling, or RN, is a method for sampling vertices with a mean degree greater than that of the graph. Instead of naïvely sampling a vertex from a graph and retaining it (‘random vertex’ or RV), a neighbor of the vertex is selected instead.
Yitzchak Novick, Amotz Bar-Noy
doaj +1 more source
On single-valued co-neutrosophic graphs [PDF]
In this paper, we introduce the notion of a single-valued co-neutrosophic graphs and study some methods of construction of new single-valued co-neutrosophic graphs.
R. Dhavaseelan +3 more
doaj +1 more source

