Results 11 to 20 of about 174,868,130 (283)
Edge-Neighbor-Rupture Degree of Graphs [PDF]
Journal of Applied Mathematics, 2013 The edge-neighbor-rupture degree of a connected graph is defined to be , where is any edge-cut-strategy of , is the number of the components of , and is the maximum order of the components of .
Ersin Aslan
doaj +6 more sources
International Journal of Foundations of Computer Science, 2017 The edge rupture degree of a graph [Formula: see text], as one of measurement parameter of network vulnerability, is defined as [Formula: see text], where [Formula: see text] is the number of components of [Formula: see text] and [Formula: see text] is the order of a largest component of [Formula: see text].
Yinkui Li +3 more
openaire +4 more sources
Some Vertex/Edge-Degree-Based Topological Indices of r-Apex Trees
Journal of Mathematics, 2021 In chemical graph theory, graph invariants are usually referred to as topological indices. For a graph G, its vertex-degree-based topological indices of the form BIDG=∑uv∈EGβdu,dv are known as bond incident degree indices, where EG is the edge set of G ...
Akbar Ali +6 more
doaj +2 more sources
Degree Associated Edge Reconstruction Number of Graphs with Regular Pruned Graph
Electronic Journal of Graph Theory and Applications, 2015 An ecard of a graph $G$ is a subgraph formed by deleting an edge. A da-ecard specifies the degree of the deleted edge along with the ecard. The degree associated edge reconstruction number of a graph $G,~dern(G),$ is the minimum number of da-ecards that ...
P. Anusha Devi, S. Monikandan
doaj +4 more sources
Degree of h-polynomials of edge ideals [PDF]
Journal of Algebraic CombinatoricsAbstract In this paper, we investigate the degree of h -polynomials of edge ideals of finite simple graphs. In particular, we provide combinatorial formulas for the degree of the h -polynomial for various fundamental classes of graphs ...
Jennifer Biermann +4 more
core +5 more sources
Star multigraphs with three vertices of maximum degree. [PDF]
, 1986 The graphs we consider here are either simple graphs, that is they have no loops or multiple edges, or are multigraphs, that is they may have more than one edge joining a pair of vertices, but again have no loops.
Hilton, A. J. W., Chetwynd, Amanda G.
core +4 more sources
Influence of reciprocal edges on degree distribution and degree correlations [PDF]
Physical Review E, 2009 Reciprocal edges represent the lowest-order cycle possible to find in directed graphs without self-loops. Representing also a measure of feedback between vertices, it is interesting to understand how reciprocal edges influence other properties of complex networks.
Štefančić, Hrvoje, Zlatić, Vinko
openaire +2 more sources
Explicit models for flexural edge and interfacial waves in thin elastic plates [PDF]
, 2011 This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.In the thesis explicit dual parabolic-elliptic models are constructed for the Konenkov flexural edge wave and the Stoneley-type flexural interfacial wave in
Kossovich, Elena
core +7 more sources
Degree-anonymization using edge rotations
Theoretical Computer Science, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cristina Bazgan +2 more
openaire +1 more source
مجلة بغداد للعلوم, 2023 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 +1 more source