Results 111 to 120 of about 696,277 (238)
几个图运算下的图的惯性指数的界(Bounding the inertia of graphs under some graph operations)
Zhejiang Daxue xuebao. Lixue ban, 2016 The inertia of a graph G is defined to be the triple In(G) = {i+ (G), i- (G)，i0 (G)}，where i+ (G)，i-(G),i0 (G) are the numbers of positive,negative and zero eigenvalues of the adjacency matrix A(G) including multiplicities, respectively.
QUHui(曲慧), LIUWeijun(刘伟俊)
doaj +1 more source
The Anatomical Record, EarlyView.Abstract Dental plates are pivotal in the lungfish paleontological record, constituting highly mineralized structures resilient to diagenetic processes. This study provides a detailed description and quantitative shape analysis of 95 newly discovered Gnathorhiza sp. dental plates from the Middle–Late Permian Corumbataí Formation, Brazil.
Mauro B. S. Lacerda +4 more
wiley +1 more source
A generalization of chromatic polynomial of a graph subdivision
Considering the partitions of a set into nonempty subsets, we obtain an expression for the number of all partitions of a given type. The chromatic polynomial of a graph subdivision is generalized, considering two sets of colors, and a general explicit ...
Szymanski, J. +2 more
core +1 more source
Arthritis &Rheumatology, EarlyView.Objective Calcium pyrophosphate deposition (CPPD) disease is a heterogeneous condition and is frequently misdiagnosed due to the different clinical presentations and variable disease progression. Aim of this study is to identify clinical phenotypes of CPPD disease by integrating real‐world data from two data sets. Methods Data from the COLCHICORT trial
Greta Pellegrino +20 more
wiley +1 more source
Fueling Tomorrow: Scenario Planning for the Future of Gas Stations
Business Strategy and the Environment, EarlyView.ABSTRACT Transport electrification is reshaping the service infrastructures that mediate everyday mobility, yet most electrification scenario studies remain macrolevel and offer limited insight into how incumbent forecourt (gas‐station) networks can adapt under deep uncertainty.
Joao Gabriel Rosa +2 more
wiley +1 more source
Bounds on Total Domination Subdivision Numbers. [PDF]
, 2003 The domination subdivision number of a graph is the minimum number of edges that must be subdivided in order to increase the domination number of the graph.
Hopkins, Lora Shuler
core +1 more source
Integrating Products, Processes, and Sourcing for Eco‐Innovation
Business Strategy and the Environment, EarlyView.ABSTRACT Eco‐innovation research has often examined regulatory or technological drivers but has paid limited attention to how long‐term organizational change shapes eco‐innovation in mature, resource‐intensive industries. This study addresses that gap by investigating how two leading Finnish pulp and paper firms integrated product, process, and ...
Misa Bakajic, Anand Nair, Markku Kuula
wiley +1 more source
Business Strategy and the Environment, EarlyView.ABSTRACT Social media platforms today have become essential for consumer‐brand interactions, with visual content playing a pivotal role in shaping engagement and brand perception. Although text‐based user‐generated content (UGC) has been widely studied, the potential of visual UGC, particularly in the travel, tourism and hospitality (TTH) sector ...
Chinchu Abraham +2 more
wiley +1 more source
The Sustainability Promise of Industry 4.0 in Supply Chains: A Technology Life Cycle–Aligned Review
Business Strategy and the Environment, EarlyView.ABSTRACT This article aims to investigate the role of information and digital technologies (IDT) of Industry 4.0 (I4.0) for sustainable supply chain management (SSCM). Methodologically, a systematic literature review has been conducted. The review analyzes 104 high‐quality articles, selecting those that belong to high‐impact journals according to the ...
Iván Roca‐Murgado +3 more
wiley +1 more source
A novel algebraic technique for adjacency matrices of some derived graphs
Mathematical and Computer Modelling of Dynamical SystemsGraph energy has been the main concern of spectral graph theory in the last five decades. The classical graph energy is the sum of the absolute values of the eigenvalues of the adjacency matrix. In many research papers, different versions of graph energy
Hacer Ozden Ayna +5 more
doaj +1 more source