Springer Science and Business Media LLC

Công bố khoa học tiêu biểu

* Dữ liệu chỉ mang tính chất tham khảo

Sắp xếp:  
On Panchromatic Digraphs and the Panchromatic Number
Springer Science and Business Media LLC - Tập 31 - Trang 115-125 - 2013
Hortensia Galeana, Ricardo Strausz
Let D =  (V, A) be a simple finite digraph, and let $${\pi(D)}$$ , the panchromatic number of D, be the maximum number of colours k such that for each (effective, or onto) colouring of its arcs ...... hiện toàn bộ
Cacti Whose Spread is Maximal
Springer Science and Business Media LLC - Tập 31 - Trang 23-34 - 2013
Tatjana M. Aleksić, Miroslav Petrović
For a simple graph G, the graph’s spread s(G) is defined as the difference between the largest eigenvalue and the least eigenvalue of the graph’s adjacency matrix, i.e. $${s(G)=\rho(G)-\lambda(G)}$$ . A connected graph G is a cactus if any two of...... hiện toàn bộ
Hamiltonian dicycles avoiding prescribed arcs in tournaments
Springer Science and Business Media LLC - Tập 3 - Trang 239-250 - 1987
Pierre Fraisse, Carsten Thomassen
If I is a set ofk − 1 arcs in ak-connected tournamentT, thenT − I has a Hamiltonian dicycle.
The New Lower Bound of the Number of Vertices of Degree 5 in Contraction Critical 5-Connected Graphs
Springer Science and Business Media LLC - Tập 26 - Trang 395-406 - 2010
Tingting Li, Jianji Su
An edge of a k-connected graph is said to be k-contractible if its contraction results in a k-connected graph. A k-connected non-complete graph with no k-contractible edge, is called contraction critical k-connected. Let G be a contraction critical 5-connected graph, in this paper we show that G has at least $${\frac{1}{...... hiện toàn bộ
On Graphs Having Maximal Independent Sets of Exactly t Distinct Cardinalities
Springer Science and Business Media LLC - Tập 29 - Trang 519-525 - 2012
Bert L. Hartnell, Douglas F. Rall
For a given positive integer t we consider graphs having maximal independent sets of precisely t distinct cardinalities and restrict our attention to those that have no vertices of degree one. In the situation when t is four or larger and the length of the shortest cycle is at least 6t − 6, we completely characterize such graphs.
Enumeration of labelled threshold graphs and a theorem of frobenius involving eulerian polynomials
Springer Science and Business Media LLC - Tập 3 - Trang 213-219 - 1987
Janet Simpson Beissinger, Uri N. Peled
We enumerate labelled threshold graphs by the number of vertices, the number of isolated vertices, and the number of distinct vertex-degrees and we give the exact asymptotics for the number of labelled threshold graphs withn vertices. We obtain the appropriate generating function and point out a combinatorial interpretation relating its coefficients to the Stirling numbers of the second kind. We u...... hiện toàn bộ
New Hadamard matrix of order 24
Springer Science and Business Media LLC - Tập 5 - Trang 235-242 - 1989
Hiroshi Kimura
In this paper we give a new Hadamard matrix of order 24 and its properties. This matrix must be appear in [11]. By this paper and Ito-Leon-Longyear [3] the classification of Hadamard matrices of order 24 is completed.
Group-Annihilator Graphs Realised by Finite Abelian Groups and Its Properties
Springer Science and Business Media LLC - Tập 38 - Trang 1-24 - 2021
Eshita Mazumdar, Rameez Raja
Let G be a finite abelian group viewed a $${\mathbb {Z}}$$ -module and let $${\mathcal {G}} = (V, E)$$ be a simple graph. In this paper, we consider a graph ...... hiện toàn bộ
A proof of a conjecture on the paired-domination subdivision number
Springer Science and Business Media LLC - Tập 38 Số 3 - 2022
Zehui Shao, Seyed Mahmoud Sheikholeslami, Mustapha Chellali, R. Khoeilar, Hossein Karami
A Note on Exact Minimum Degree Threshold for Fractional Perfect Matchings
Springer Science and Business Media LLC - - 2022
Hongliang Lu, Xingxing Yu
Tổng số: 1,993   
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 10