✦ LIBER ✦

A unified approach to the first derivatives of graph polynomials

✍ Scribed by Xueliang Li; Ivan Gutman

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 246 KB
Volume: 58
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(95)00121-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Unified Approach to a Characterization

A Unified Approach to a Characterization of Grassmann Graphs and Bilinear Forms Graphs

✍ Tung-Shan Fu; Tayuan Huang 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 377 KB

Wilbrink and Brouwer [18] proved that certain semi-partial geometries with some weak restrictions on parameters satisfy the dual of Pasch's axiom. Inspired by their work, a class of incidence structures associated with distance-regular graphs with classical parameters is studied in this paper. As a

A unified approach to parallel depth-fir

A unified approach to parallel depth-first traversals of general trees

✍ Calvin C.-Y. Chen; Sajal K. Das; Selim G. Akl 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 890 KB

A unified approach to polynomially solva

A unified approach to polynomially solvable cases of integer “non-separable” quadratic optimization

✍ Ross Baldick 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 1011 KB

Application of a Unified Matrix Polynomi

Application of a Unified Matrix Polynomial Approach (UMPA) to Perturbed Boundary Condition (PBC) testing

✍ Shumin Li; David L. Brown 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 431 KB

A Unified Matrix Polynomial Approach (UMPA) is discussed in this paper as a possible method of condensing multiple sets of Perturbed Boundary Condition (PBC) test data into a single modal model of the unmodified system. The PBC testing provides a much larger database that contains more information a

Clustering analysis for graphs with mult

Clustering analysis for graphs with multiweighted edges: A unified approach to the threshold problem

✍ Goetschel, Roy 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 494 KB 👁 2 views

Multivalent relations, inferred as relationships with an added dimension of discernment, are realized as weighted graphs with multivalued edges. A unified treatment of the threshold problem is discussed and a reliability measure is produced to judge various partitions. 'R+ represents the non-negati

Optimal clustering in graphs with weight

Optimal clustering in graphs with weighted edges: A unified approach to the threshold problem

✍ Goetschel, Roy ;Voxman, William 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 691 KB

## Relations on a finite set V are viewed as weighted graphs. Using the language of graph theory two methods of partitioning V are examined. In one method, partitionings of V are obtained by selecting threshold values and applying them to a maximal weighted spanning forest. In another method a para