Results 251 to 260 of about 2,145,411 (284)

Acyclic Edge Coloring of Chordal Graphs with Bounded Degree

Graphs and Combinatorics, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ma, Yulai, Shi, Yongtang, Wang, Weifan
openaire   +2 more sources

On edge-rupture degree of graphs

Applied Mathematics and Computation, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Li, Fengwei, Ye, Qingfang, Sun, Yuefang
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)\).
Juvan, Martin, Mohar, Bojan, Škrekovski, Riste   +2 more
openaire   +2 more sources

Restricted edge connectivity of graphs on degree

Journal of Intelligent & Fuzzy Systems, 2018
Let G = ( V , E ) be a connected graph. An edge set S ⊂ E is a 3-restricted edge cut, if G - S is disconnected and every component of G -
Guo, Litao, Lin, Bernard L.S.
openaire   +1 more source

Light subgraphs in planar graphs of minimum degree 4 and edge‐degree 9

Journal of Graph Theory, 2003
AbstractA graph H is light in a given class of graphs if there is a constant w such that every graph of the class which has a subgraph isomorphic to H also has a subgraph isomorphic to H whose sum of degrees in G is ≤ w. Let $\cal G$ be the class of simple planar graphs of minimum degree ≥ 4 in which no two vertices of degree 4 are adjacent.
Mohar, B., Škrekovski, R., Voss, H.-J.
openaire   +1 more source

On the Existence of Simultaneous Edge Disjoint Realizations of Degree Sequences with “Few” Edges

SIAM Journal on Applied Mathematics, 1977
Abstract : This paper contains the following results. For a sequence A, let (M sub A) be the number of non-zero entries in it; suppose A, B and C = (A+B) are sequences that are the degrees of simple graphs; then if summation of (c sub i) or or = 2(M sub A) + (M sub B) - 2, there exists a realization of C having disjoint factors with degree sequences A ...
Kleitman, D. J., Koren, M., Li, S.-Y. R.
openaire   +2 more sources

The Spectral Edge of Constant Degree Erdős–Rényi Graphs

Random Structures & Algorithms
ABSTRACTWe show that for an Erdős–Rényi graph on vertices with expected degree satisfying , the largest eigenvalues can be precisely determined by small neighborhoods around vertices of close to maximal degree. Moreover, under the added condition that , the corresponding eigenvectors are localized, in that the mass of the eigenvector decays ...
Ella Hiesmayr, Theo McKenzie
openaire   +1 more source

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.
Borzooei, R.A., Rashmanlou, Hossein
openaire   +1 more source

On the average degree of edge chromatic critical graphs II

Journal of Combinatorial Theory, Series B, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cao, Yan, Chen, Guantao
openaire   +1 more source

Edge Version of Some Degree Based Topological Descriptors of Graphs

2018
In this paper, we study the edge version of some degree based topological indices such as general sum-connectivity index, Randic index, inverse sum indeg index, symmetric division deg index, augmenting Zagreb index and harmonic polynomial for joint graphs and certain graph operations.
Pattabiraman, K, Suganya, T
openaire   +1 more source