Results 261 to 270 of about 174,868,130 (283)

Degree and total degree of edges in bipolar fuzzy graphs with application

Journal of Intelligent & Fuzzy Systems, 2016
It is known that bipolar models give more precision, flexibility and compatibility to the system as compare to the classic and fuzzy models. A bipolar fuzzy graph can be obtained from two given bipolar fuzzy graphs using cartesian product and composition. In this paper, we have introduced the degree and total degree of an edge.
Rajab Ali Borzooei, Hossein Rashmanlou
openaire   +1 more source

Restricted edge-connectivity and minimum edge-degree

Ars Comb., 2003
For a connected graph \(G(V,E)\), an edge set \(S\subset E\) is a restricted edge-cut of \(G\) if \(G\setminus S\) is disconnected without isolated vertices. The restricted edge-connectivity \(\lambda '(G)\) of \(G\) is the size of the smallest edge-cut of \(G\).
Nicola Ueffing, Lutz Volkmann
openaire   +2 more sources

Degree sequences and edge connectivity

Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg, 2017
For each positive integer \(k\), one can associate a finite list \(C\)(\(k\)) of Bondy-Chvátal type conditions on a nondecreasing sequence \(d=(d_1,\dots ,d_n)\) of nonnegative integers such that every graph on \(n\) vertices with degree sequence at least \(d\) is \(k\)-edge-connected.
openaire   +2 more sources

Graphs of degree 4 are 5-edge-choosable

Journal of Graph Theory, 1999
A list assignment of a graph \(G\) is a function \(L\) that assigns to each edge \(e\in E(G)\) a list \(L(e)\subseteq N\). A list coloring is a function \(\lambda :E(G)\rightarrow N\) such that \(\lambda (e)\in L(e)\) for every \(e\in E(G)\) and such that, for any pair of adjacent edges \(e\), \(f\) in \(G\), \(\lambda (e)\neq \lambda (f)\).
Martin Juvan, Bojan Mohar, Riste Skrekovski   +2 more
openaire   +3 more sources

Injective Edge Coloring of Graphs With Maximum Degree 5

Discrete Applied Mathematics, 2023
Junlei Zhu
exaly  

Reliability Analysis of 3-Ary n-Cube in Terms of Average Degree Edge-Connectivity

Discrete Applied Mathematics, 2023
Shuming Zhou, Qifan Zhang
exaly  

Topological Index Based on the Ratios of Geometrical and Arithmetical Means of End-Vertex Degrees of Edges

Journal of Mathematical Chemistry, 2009
Boris Furtula, Damir Vukicevic
exaly  

Color Degree and Monochromatic Degree Conditions for Short Properly Colored Cycles in Edge-Colored Graphs

Journal of Graph Theory, 2018
Ruonan Li, Shinya Fujita, Shenggui Zhang
exaly  

Degree Sequence Conditions for Maximally Edge-Connected and Super Edge-Connected Hypergraphs

Graphs and Combinatorics, 2020
Jixiang Meng, Yingzhi Tian
exaly  

A Degree Sum Condition for the Existence of a Contractible Edge in a κ-Connected Graph

Journal of Combinatorial Theory Series B, 2001
Matthias Kriesell
exaly