Results 261 to 270 of about 2,145,411 (284)
Some of the next articles are maybe not open access.
Vertex-Distinguishing Edge Colorings of Graphs with Degree Sum Conditions
Graphs and Combinatorics, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Liu, Bin, Liu, Guizhen
openaire +1 more source
Sequences of degrees of edges of self-complementary graphs
Mathematical Notes of the Academy of Sciences of the USSR, 1983The degree of an edge of a graph is the unordered pair of degrees of its end vertices. A graph G is a realization of a sequence of unordered pairs of natural numbers if this sequence consists of the degrees of the edges of G. This paper characterizes those sequences that have self- complementary realizations.
openaire +2 more sources
Construction of a Maximally Edge‐Connected Graph with Prescribed Degrees
Studies in Applied Mathematics, 1976Let 〈d1,d2,...,dp,〉 be a realizable degree sequence, di⩾2; then a graph G can be constructed so that deg(vi and so that for i≠j, the number of edge‐disjoint paths between vi and vj is (di,dj).
openaire +2 more sources
Injective edge coloring of graphs with maximum degree 5
Discrete Applied Mathematics, 2023Junlei Zhu
exaly
Nanomechanical topological insulators with an auxiliary orbital degree of freedom
Nature Nanotechnology, 2021Jingwen Ma, Xiang Xi, Yuan Li
exaly
Inverse degree and edge-connectivity
Discrete Mathematics, 2009Peter Dankelmann, Lutz Volkmann
exaly
Convergence of Edge Computing and Deep Learning: A Comprehensive Survey
IEEE Communications Surveys and Tutorials, 2020Xiaofei Wang +2 more
exaly
Degree Sequence Conditions for Maximally Edge-Connected and Super Edge-Connected Hypergraphs
Graphs and Combinatorics, 2020Yingzhi Tian, Jixiang Meng
exaly
Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
Journal of Combinatorial Optimization, 2008Weifan Wang
exaly