Špela Brglez

University of Maribor

Bound graphEngineeringRequirements managementSystems engineeringRequirements elicitation

3Publications

2H-index

8Citations

What is this?

Publications 3

Newest

A discussion on new necessity-based method for requirements list elicitation and requirements classification

#1Špela Brglez (University of Maribor)H-Index: 2

#2Bojan Dolšak (University of Maribor)H-Index: 11

Establishing appropriate requirements is essential in early phases of product design for obtaining enough information and in order not to over-constrain the product. Consequences of failing to do so are discussed. An overview of state-of-the-art methodologies for eliciting and classifying requirements is presented. Existing elicitation methods tend not to focus on the requirements content and the classification methods overlook the missing requirements. To overcome this gap a new method for requ...

#1Špela Brglez (University of Maribor)H-Index: 2

#2Bojan Dolšak (University of Maribor)H-Index: 11

#1Xiang-Lan Cao (XJU: Xinjiang University)H-Index: 2

#2Špela Brglez (University of Maribor)H-Index: 2

Last. Elkin Vumar (XJU: Xinjiang University)H-Index: 6

view all 4 authors...

Let @l(G) be the edge connectivity of G. The direct product of graphs G and H is the graph with vertex set V(GxH)=V(G)xV(H), where two vertices (u"1,v"1) and (u"2,v"2) are adjacent in GxH if u"1u"2@?E(G) and v"1v"2@?E(H). We prove that @l(GxK"n)=min{n(n-1)@l(G),(n-1)@d(G)} for every nontrivial graph G and n>=3. We also prove that for almost every pair of graphs G and H with n vertices and edge probability p, GxH is k-connected, where k=O((n/logn)^2).

1