Your browser does not allow JavaScript!
JavaScript is necessary for the proper functioning of this website. Please enable JavaScript or use a modern browser.
|
|
SLO
|
ENG
|
Cookies and privacy
DKUM
EPF - Faculty of Business and Economics
FE - Faculty of Energy Technology
FERI - Faculty of Electrical Engineering and Computer Science
FF - Faculty of Arts
FGPA - Faculty of Civil Engineering, Transportation Engineering and Architecture
FKBV - Faculty of Agriculture and Life Sciences
FKKT - Faculty of Chemistry and Chemical Engineering
FL - Faculty of Logistic
FNM - Faculty of Natural Sciences and Mathematics
FOV - Faculty of Organizational Sciences in Kranj
FS - Faculty of Mechanical Engineering
FT - Faculty of Tourism
FVV - Faculty of Criminal Justice and Security
FZV - Faculty of Health Sciences
MF - Faculty of Medicine
PEF - Faculty of Education
PF - Faculty of Law
UKM - University of Maribor Library
UM - University of Maribor
UZUM - University of Maribor Press
COBISS
Faculty of Business and Economic, Maribor
Faculty of Agriculture and Life Sciences, Maribor
Faculty of Logistics, Celje, Krško
Faculty of Organizational Sciences, Kranj
Faculty of Criminal Justice and Security, Ljubljana
Faculty of Health Sciences
Library of Technical Faculties, Maribor
Faculty of Medicine, Maribor
Miklošič Library FPNM, Maribor
Faculty of Law, Maribor
University of Maribor Library
Bigger font
|
Smaller font
Introduction
Search
Browsing
Upload document
Statistics
Login
First page
>
Show document
Show document
Title:
Graphs with given number of cut-edges and minimal value of Wiener number
Authors:
ID
Šparl, Petra
(
Author
)
ID
Žerovnik, Janez
(
Author
)
Files:
https://www.novapublishers.com/catalog/product_info.php?products_id=25726
Language:
English
Work type:
Not categorized
Typology:
1.01 - Original Scientific Article
Organization:
FOV - Faculty of Organizational Sciences in Kranj
Abstract:
A new graph operation is proposed which generalizes two operatins by Hua and its usability is illustrated by proving a theorem which characterizes the graphs with given number of cut-edges and minimal value of the Wiener number.
Keywords:
kemijska teorija grafov
,
topološki indeksi
,
Wienerjevo število
,
chemical graph theory
,
topological indices
,
Wiener number
Year of publishing:
2011
Number of pages:
str. 131-137
Numbering:
Vol. 3, iss. 1-2
PID:
20.500.12556/DKUM-51431
UDC:
519.173
ISSN on article:
1941-3955
COBISS.SI-ID:
6828819
NUK URN:
URN:SI:UM:DK:LSPJ381U
Publication date in DKUM:
10.07.2015
Views:
14168
Downloads:
55
Metadata:
Categories:
Misc.
Cite this work
Plain text
BibTeX
EndNote XML
EndNote/Refer
RIS
ABNT
ACM Ref
AMA
APA
Chicago 17th Author-Date
Harvard
IEEE
ISO 690
MLA
Vancouver
:
Copy citation
Average score:
(0 votes)
Your score:
Voting is allowed only for
logged in
users.
Share:
Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.
Record is a part of a journal
Title:
International journal of chemical modeling
Shortened title:
Int. j. chem. model.
Publisher:
Nova Science Publishers
ISSN:
1941-3955
COBISS.SI-ID:
4445466
Comments
Leave comment
You must
log in
to leave a comment.
Comments (0)
0 - 0 / 0
There are no comments!
Back
