-
Permutation inequalitiesKovič, JurijV članku formuliramo in rešimo nekaj posebnih primerov naslednjega (v splošnem NP-težkega) ekstremalnega problema: "Oštevilči vozlišča danega grafa ▫$G$▫ (ali hipergrafa ▫$H$▫) z danimi ▫$n$▫ ... nenegativnimi števili ▫$a_1 \geqslant a_2 \geqslant \dots \geqslant a_n \geqslant 0$▫ tako, da bo vsota produktov števil, prirejenih parom sosednjih vozlišč, ▫$f = \sum a_ia_j$▫ maksimalna (ali minimalna)." Rešitve tega problema za nekatere posebne družine grafov (npr. za poti, drevesa in zvezde) nam dajo primere "permutacijskih neenačb" ▫$f_{min} \geqslant f \geqslant f_{max}▫$.Source: Mathematical inequalities & applications. - ISSN 1331-4343 (Vol. 17, no. 2, 2014, str. 419-429)Type of material - article, component partPublish date - 2014Language - englishCOBISS.SI-ID - 16972633
Author
Kovič, Jurij
Topics
matematika |
teorija grafov |
grafi |
hipergrafi |
maksimalno oštevilčenje |
permutacije |
neenačbe |
mathematics |
graph theory |
graph |
hypergraph |
maximal labeling |
permutation |
inequality
source: Mathematical inequalities & applications. - ISSN 1331-4343 (Vol. 17, no. 2, 2014, str. 419-429)
Shelf entry
Permalink
- URL:
Impact factor
Access to the JCR database is permitted only to users from Slovenia. Your current IP address is not on the list of IP addresses with access permission, and authentication with the relevant AAI accout is required.
Year | Impact factor | Edition | Category | Classification | ||||
---|---|---|---|---|---|---|---|---|
JCR | SNIP | JCR | SNIP | JCR | SNIP | JCR | SNIP |
Select the library membership card:
DRS, in which the journal is indexed
Database name | Field | Year |
---|
Links to authors' personal bibliographies | Links to information on researchers in the SICRIS system |
---|---|
Kovič, Jurij | 11234 |
Select pickup location:
Material pickup by post
Notification
Subject headings in COBISS General List of Subject Headings
Select pickup location
Pickup location | Material status | Reservation |
---|
Please wait a moment.