Results 21 to 30 of about 174,868,130 (283)
Weak edge-degree domination in hypergraphs [PDF]
Czechoslovak Mathematical Journal, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Acharya, Belmannu Devadas +1 more
openaire +1 more source
Reformulated Zagreb Indices of Some Derived Graphs
Mathematics, 2019 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
S-metric, degree assortativity, and edge multiplicities of the multiplex.
, 2021 S-metric, degree assortativity, and edge multiplicities of the multiplex.
Ralucca Gera (8541165) +3 more
core +2 more sources
Maximum average degree of list-edge-critical graphs and Vizing's conjecture
Electronic Journal of Graph Theory and Applications, 2022 Vizing conjectured that χ′ℓ(G)≤Δ + 1 for all graphs. For a graph G and nonnegative integer k, we say G is a k-list-edge-critical graph if χ′ℓ(G)>k, but χ′ℓ(G − e)≤k for all e ∈ E(G).
Joshua Harrelson, Hannah Reavis
doaj +1 more source
On edge-graceful labeling and deficiency for regular graphs
AKCE International Journal of Graphs and Combinatorics, 2018 An edge-graceful labeling of a finite simple graph with p vertices and q edges is a bijection from the set of edges to the set of integers { 1 , 2 , … , q } such that the vertex sums are pairwise distinct modulo p , where the vertex sum at a vertex is ...
Tao-Ming Wang, Guang-Hui Zhang
doaj +2 more sources
Degree associated edge reconstruction number of split graphs with biregular independent set is one
AKCE International Journal of Graphs and Combinatorics, 2020 A degree associated edge card of a graph G is an edge deleted subgraph of G with which the degree of the deleted edge is given. The degree associated edge reconstruction number of a graph G (or dern(G)) is the size of the smallest collection of the ...
N. Kalai Mathi, S. Monikandan
doaj +1 more source
Edge colorings of planar graphs [PDF]
, 2023 The research on edge coloring is mainly divided into two categories. One is to study the edge chromatic number of graphs, and the other is to study the conditions for the existence of subgraphs with certain coloring characteristics in edge colored graphs.
Zhang, Li
core +1 more source
Network Design with Edge-Connectivity and Degree Constraints [PDF]
Theory of Computing Systems, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Takuro Fukunaga, Hiroshi Nagamochi
openaire +2 more sources
Structural controllability of general edge dynamics in complex network
Scientific Reports, 2023 Dynamic processes that occur on the edge of complex networks are relevant to a variety of real-world systems, where states are defined on individual edges, and nodes are active components with information processing capabilities.
Shaopeng Pang +3 more
doaj +1 more source
On r-Edge Regular Neutrosophic Graphs [PDF]
Neutrosophic Sets and Systems, 2023 We approach learning characteristic on a neutrosophic graph such as r-edge regular neutrosophic graph, strongly edge regular neutrosophic graph and absolute degree of vertex since a neutrosophic set 𝑁𝑆 = {〈𝑥, 𝑁𝑆𝔗(𝑥), 𝑁𝑆𝔩 (𝑥), 𝑁𝑆𝔉(𝑥)〉; 𝑥 ∈ 𝑋} of a ...
M. Kaviyarasu
doaj +1 more source