| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document

Title:Cage-amalgamation graphs, a common generalization of chordal and median graphs
Authors:Brešar, Boštjan (Author)
Tepeh, Aleksandra (Author)
Files:URL http://dx.doi.org/10.1016/j.ejc.2008.09.003
 
Language:English
Work type:Not categorized (r6)
Typology:1.01 - Original Scientific Article
Organization:FERI - Faculty of Electrical Engineering and Computer Science
Abstract:V članku je vpeljan in na različne načine okarakteriziran nov razred grafov, imenovan grafi amalgamov kletk, ki je vsebovan v šibko modularnih grafih in grafih zastraženih inverzov in ki vsebuje tako medianske kot tetivne grafe. Vpeljemo tudi variacijo Hammingovega polinoma in jo uporabimo pri izpeljavi dveh enakosti drevesnega tipa za ta razred grafov, ki sta bili prej znani za tetivne in medianske grafe. Prva enakost je ▫$sum_{ige 0}, (-1)^{i}, rho_i(G)=1$▫, kjer je ▫$rho_i(G)$▫ število ▫$i$▫-regularnih Hammingovih podgrafov v grafu amalgamov kletk ▫$G$▫.
Keywords:matematika, teorija grafov, medianski grafi, tetivni grafi, konveksnost, amalgamacija, enakosti drevesnega tipa, mathematics, graph theory, median graphs, chordal graphs, convexity, amalgamation, tree-like equalities
Year of publishing:2009
Number of pages:str. 1071-1081
Numbering:Vol. 30, no. 5
UDC:519.17
ISSN on article:0195-6698
COBISS_ID:15146329 Link is opened in a new window
NUK URN:URN:SI:UM:DK:8YUNTMZ8
Views:271
Downloads:49
Metadata:XML RDF-CHPDL DC-XML DC-RDF
Categories:Misc.
:
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:AddThis
AddThis uses cookies that require your consent. Edit consent...

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:European journal of combinatorics
Shortened title:Eur. j. comb.
Publisher:Academic Press
ISSN:0195-6698
COBISS.SI-ID:25427968 New window

Secondary language

Language:Unknown
Title:Grafi amalgamov kletk, skupna posplošitev tetivnih in medianskih grafov
Abstract:A class of graphs, called cage-amalgamation graphs, that is contained in weakly modular and fiber-complemented graphs and contains median and chordal graphs, is introduced and characterized in several ways. A variation of the Hamming polynomial is also introduced and used in obtaining two tree-like equalities for these graphs, that were previously known for both chordal and median graphs. The first equality is ▫$sum_{i ge 0}(-1)^i rho_i(G) = 1$▫, where ▫$rho_i(G)$▫ is the number of ▫$i$▫-regular Hamming subgraphs in a cage-amalgamation graph ▫$G$▫.


Comments

Leave comment

You have to log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica