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:
Binary coding of resonance graphs of catacondensed polyhexes
Authors:
ID
Vesel, Aleksander
(
Author
)
Files:
RAZ_Vesel_Aleksander_2023.pdf
(518,69 KB)
MD5: 9B8192572FE419CDA35FD0FD9A821352
https://match.pmf.kg.ac.rs/
Language:
English
Work type:
Article
Typology:
1.01 - Original Scientific Article
Organization:
FNM - Faculty of Natural Sciences and Mathematics
Abstract:
A catacondensed polyhex H is a connected subgraph of a hexagonal system such that any edge of H lies in a hexagon of H, any triple of hexagons of H has an empty intersection and the inner dual of H is a cactus graph. A perfect matching M of a catacondensed polyhex H is relevant if every cycle of the inner dual of H admitsa vertex that corresponds to the hexagon which contributes three edges in M. The vertex set of the graph R˜(H) consists of all relevant perfect matchings of H, two perfect matchings being adjacent whenever their symmetric difference forms the edge set of a hexagon of H. A labeling that assigns in linear time a binary string to every relevant perfect matching of a catacondensed polyhex is presented. The introduced labeling defines an isometric embedding of R˜(H) into a hypercube.
Keywords:
graphs
,
graph theory
,
resonance graphs
Publication status:
Published
Publication version:
Version of Record
Submitted for review:
05.01.2023
Article acceptance date:
05.01.2023
Publication date:
10.01.2023
Publisher:
Faculty of Science & University of Kragujevac
Year of publishing:
2023
Number of pages:
str. 429-452
Numbering:
Vol. 90, no. 2
PID:
20.500.12556/DKUM-88140
UDC:
519.17
ISSN on article:
0340-6253
COBISS.SI-ID:
148521219
DOI:
10.46793/match.90-2.429V
Publication date in DKUM:
07.06.2024
Views:
238
Downloads:
28
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:
Match : communications in mathematical and in computer chemistry
Shortened title:
Match
Publisher:
University of Kragujevac, Faculty of Science
ISSN:
0340-6253
COBISS.SI-ID:
2624551
Document is financed by a project
Funder:
ARIS - Slovenian Research and Innovation Agency
Project number:
P1-0297-2022
Name:
Teorija grafov
Funder:
ARIS - Slovenian Research and Innovation Agency
Project number:
J1-2452-2020
Name:
Strukturni, optimizacijski in algoritmični problemi v geometrijskih in topoloških predstavitvah grafov
Funder:
ARIS - Slovenian Research and Innovation Agency
Project number:
J1-1693-2019
Name:
Sodobni in novi metrični koncepti v teoriji grafov
Licences
License:
CC BY 4.0, Creative Commons Attribution 4.0 International
Link:
http://creativecommons.org/licenses/by/4.0/
Description:
This is the standard Creative Commons license that gives others maximum freedom to do what they want with the work as long as they credit the author.
Comments
Leave comment
You must
log in
to leave a comment.
Comments (0)
0 - 0 / 0
There are no comments!
Back
