Results 31 to 40 of about 310,108 (288)
A SURVEY M-POLAR FUZZY GRAPHS [PDF]
Fiabilitate şi Durabilitate, 2019 I will begin with the presentation of the basic definitions required for the development of this survey- graph. Rosenfeld [17] first introduced the concept of fuzzy graphs. After that fuzzy graph theory becomes a vast research area.
Iuliana Carmen BĂRBĂCIORU
doaj
Concepts of vertex regularity in cubic fuzzy graph structures with an application
Frontiers in Physics, 2023 The cubic fuzzy graph structure, as a combination of cubic fuzzy graphs and fuzzy graph structures, shows better capabilities in solving complex problems, especially in cases where there are multiple relationships.
Li Li +3 more
doaj +1 more source
Almost sure convergence of vertex degree densities in the vertex-splitting model
, 2015 We study the limiting degree distribution of the vertex splitting model introduced in \cite{DDJS:2009}. This is a model of randomly growing ordered trees, where in each time step the tree is separated into two components by splitting a vertex into two ...
Stefánsson, Sigurdur Örn +1 more
core +1 more source
On degree-sequence characterization and the extremal number of edges for various Hamiltonian properties under fault tolerance [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 Assume that $n, \delta ,k$ are integers with $0 \leq k < \delta < n$. Given a graph $G=(V,E)$ with $|V|=n$. The symbol $G-F, F \subseteq V$, denotes the graph with $V(G-F)=V-F$, and $E(G-F)$ obtained by $E$ after deleting the edges with at least one ...
Shih-Yan Chen, Shin-Shin Kao, Hsun Su
doaj +1 more source
Improved Algorithm for Degree Bounded Survivable Network Design Problem
, 2009 We consider the Degree-Bounded Survivable Network Design Problem: the objective is to find a minimum cost subgraph satisfying the given connectivity requirements as well as the degree bounds on the vertices.
K. Chaudhuri +8 more
core +2 more sources
Chebyshev Action on Finite Fields [PDF]
, 2013 Given a polynomial f and a finite field F one can construct a directed graph where the vertices are the values in the finite field, and emanating from each vertex is an edge joining the vertex to its image under f.
Gassert, T. Alden
core +1 more source
Dynamics of heuristic optimization algorithms on random graphs
, 2002 In this paper, the dynamics of heuristic algorithms for constructing small vertex covers (or independent sets) of finite-connectivity random graphs is analysed. In every algorithmic step, a vertex is chosen with respect to its vertex degree. This vertex,
Weigt, Martin
core +1 more source
FEBS Letters, EarlyView.In this study, we found that human cervical‐derived adipocytes maintain intracellular iron level by regulating the expression of iron transport‐related proteins during adrenergic stimulation. Melanotransferrin is predicted to interact with transferrin receptor 1 based on in silico analysis.
Rahaf Alrifai +9 more
wiley +1 more source
A Note on Distance-Based Entropy of Dendrimers
Axioms, 2019 This paper introduces a variant of entropy measures based on vertex eccentricity and applies it to all graphs representing the isomers of octane. Taking into account the vertex degree as well (degree-ecc-entropy), we find a good correlation with the ...
Modjtaba Ghorbani +4 more
doaj +1 more source
FEBS Letters, EarlyView.Structural and biochemical characterisations show that the planar cell polarity (PCP) protein Inturned harbours a unique PDZ‐like domain that does not bind canonical PDZ‐binding motifs (PBMs) like that of another PCP protein Vangl2. In contrast, the apical‐basal polarity protein Scribble contains four PDZ domains that bind Vangl2, but one PDZ domain ...
Stephan Wilmes +4 more
wiley +1 more source