Edge realizability of connected simple graphs

Pierre Hansen; Alain Hertz; Cherif Sellal; Damir Vukičević; Mustapha Aouchiche; Gilles Caporossi

Edge realizability of connected simple graphs

Pierre Hansen
, Alain Hertz
, Cherif Sellal
, Damir Vukičević
, Mustapha Aouchiche
, Gilles Caporossi

Research output: Contribution to journal › Article › peer-review

Abstract

Necessary and sufficient conditions are provided for the existence of a simple graph, or a simple connected graph with given numbers m_ij of edges with end-degrees i, j for i ≤ j ∈ {1, 2, . . ., ∆}, where ∆ is the maximum degree. Moreover this allows to determine the k^th-minimum or maximum value of all Adriatic indices together with the corresponding graphs.

Original language	English
Pages (from-to)	689-712
Number of pages	24
Journal	Match
Volume	78
Issue number	3
Publication status	Published - 2017
Externally published	Yes

ASJC Scopus subject areas

General Chemistry
Computer Science Applications
Computational Theory and Mathematics
Applied Mathematics

Cite this

@article{ff75ba960b7046b6b8499a49fdeb36de,

title = "Edge realizability of connected simple graphs",

abstract = "Necessary and sufficient conditions are provided for the existence of a simple graph, or a simple connected graph with given numbers mij of edges with end-degrees i, j for i ≤ j ∈ \{1, 2, . . ., ∆\}, where ∆ is the maximum degree. Moreover this allows to determine the kth-minimum or maximum value of all Adriatic indices together with the corresponding graphs.",

author = "Pierre Hansen and Alain Hertz and Cherif Sellal and Damir Vuki{\v c}evi{\'c} and Mustapha Aouchiche and Gilles Caporossi",

year = "2017",

language = "English",

volume = "78",

pages = "689--712",

journal = "Match",

issn = "0340-6253",

publisher = "University of Kragujevac, Faculty of Science",

number = "3",

}

TY - JOUR

T1 - Edge realizability of connected simple graphs

AU - Hansen, Pierre

AU - Hertz, Alain

AU - Sellal, Cherif

AU - Vukičević, Damir

AU - Aouchiche, Mustapha

AU - Caporossi, Gilles

PY - 2017

Y1 - 2017

N2 - Necessary and sufficient conditions are provided for the existence of a simple graph, or a simple connected graph with given numbers mij of edges with end-degrees i, j for i ≤ j ∈ {1, 2, . . ., ∆}, where ∆ is the maximum degree. Moreover this allows to determine the kth-minimum or maximum value of all Adriatic indices together with the corresponding graphs.

AB - Necessary and sufficient conditions are provided for the existence of a simple graph, or a simple connected graph with given numbers mij of edges with end-degrees i, j for i ≤ j ∈ {1, 2, . . ., ∆}, where ∆ is the maximum degree. Moreover this allows to determine the kth-minimum or maximum value of all Adriatic indices together with the corresponding graphs.

UR - https://www.scopus.com/pages/publications/85072202724

UR - https://www.scopus.com/pages/publications/85072202724#tab=citedBy

M3 - Article

AN - SCOPUS:85072202724

SN - 0340-6253

VL - 78

SP - 689

EP - 712

JO - Match

JF - Match

IS - 3

ER -

Edge realizability of connected simple graphs

Abstract

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this